login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A238610 Number of partitions of n^5 into parts that are at most n. 2
1, 1, 17, 5043, 7566280, 33432635477, 331281477244572, 6242342067484101895, 200386212932492140762672, 10133053906998476170548376403, 761287353202857218355451068558296, 81209207250425252838671771562105020103, 11863819168025774694177783984734986151951164 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..60

FORMULA

a(n) = [x^(n^5)] Product_{j=1..n} 1/(1-x^j).

a(n) ~ exp(2*n) * n^(3*n-5) / (2*Pi). - Vaclav Kotesovec, May 25 2015

CROSSREFS

Column k=5 of A238016.

Sequence in context: A015034 A161583 A013722 * A052286 A079687 A062659

Adjacent sequences:  A238607 A238608 A238609 * A238611 A238612 A238613

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Mar 01 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 17 15:32 EST 2020. Contains 331998 sequences. (Running on oeis4.)