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!)
A368048 a(n) = lcm_{p in Partitions(n)} (Product_{t in p}(t + m)), where m = 2. 3
1, 3, 36, 540, 6480, 136080, 8164800, 24494400, 293932800, 48498912000, 4073908608000, 158882435712000, 9532946142720000, 28598838428160000, 343186061137920000, 612587119131187200000, 7351045429574246400000, 419009589485732044800000, 276546329060583149568000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
With m = 0, the cumulative radical A048803 is computed, and with m = 1 the Hirzebruch numbers A091137. The general array is A368116. Using the terminology introduced in A368116 a(n) = lcm_{p in P_{2}(n)} Prod(p).
LINKS
FORMULA
a(n) = A368092(n) * 2^(n - n mod 2).
EXAMPLE
Let n = 4. The partitions of 4 are [(4), (3, 1), (2, 2), (2, 1, 1), (1, 1, 1, 1)]. Thus a(4) = lcm([6, 5*3, 4*4, 4*3*3, 3*3*3*3]) = 6480.
PROG
(SageMath)
def a(n): return lcm(product(r + 2 for r in p) for p in Partitions(n))
print([a(n) for n in range(20)])
CROSSREFS
Sequence in context: A322491 A305678 A233196 * A245114 A276018 A291096
KEYWORD
nonn
AUTHOR
Peter Luschny, Dec 12 2023
STATUS
approved

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 July 20 14:40 EDT 2024. Contains 374447 sequences. (Running on oeis4.)