Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)

Revision History for A091137

(Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A091137 The Hirzebruch numbers. a(n) = Product_{2 <= p <= n+1, p prime} p^floor(n / (p - 1)).
(history; published version)
#70 by Peter Luschny at Fri Sep 06 11:05:45 EDT 2024
STATUS

proposed

approved

#69 by Stefano Spezia at Fri Sep 06 03:54:44 EDT 2024
STATUS

editing

proposed

#68 by Stefano Spezia at Fri Sep 06 03:54:03 EDT 2024
LINKS

Donghyun Kim and Jaeseong Oh, <a href="https://www.arxiv.org/abs/2409.01041">Extending the science fiction and the Loehr--Warrington formula</a>, arXiv:2409.01041 [math.CO], 2024. See p. 32.

STATUS

approved

editing

#67 by Peter Luschny at Thu Dec 14 17:36:23 EST 2023
STATUS

proposed

approved

#66 by Michel Marcus at Thu Dec 14 16:49:50 EST 2023
STATUS

editing

proposed

#65 by Michel Marcus at Thu Dec 14 16:49:46 EST 2023
LINKS

Victor M. Buchstaber, and Alexander P. Veselov, <a href="https://doi.org/10.48550/arXiv.2310.07383">Todd polynomials and Hirzebruch numbers</a>, arXiv:2310.07383 [math.AT], Oct. 2023.

STATUS

proposed

editing

#64 by Peter Luschny at Thu Dec 14 16:15:00 EST 2023
STATUS

editing

proposed

#63 by Peter Luschny at Thu Dec 14 03:34:28 EST 2023
FORMULA

a(n) = A368116(1, n), seen as the lcm of the product of the 1-shifted partitions.

#62 by Peter Luschny at Thu Dec 14 03:33:23 EST 2023
FORMULA

a(n) = lcm(A238963row(n)). (End))).

a(n) = A368116(1, n), seen as the lcm of the 1-shifted partitions.

a(n) = A368093(1, n), seen as the cumulative product of the Clausen numbers A160014(1, n). (End)

CROSSREFS

Cf. A090622, A090624, A091136, A171080, A238963, A368093, A368116.

#61 by Peter Luschny at Tue Dec 12 05:32:32 EST 2023
PROG

# Or, more efficient:

from functools import cache

@cache

def a_rec(n):

if n == 0: return 1

print([a p = mul(n) s for ns in rangemap(22)]) # _Peter Luschny_, Declambda 11i: i + 1, divisors(n)) if 2023is_prime(s))

return p * a_rec(n - 1)

print([a_rec(n) for n in range(22)]) # Peter Luschny, Dec 12 2023

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 12 09:47 EDT 2024. Contains 375850 sequences. (Running on oeis4.)