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!)
A238611 Number of partitions of n^6 into parts that are at most n. 2
1, 1, 33, 44652, 478968264, 20735819929227, 2561606354507677872, 731267824140098782358035, 418829370245413954052212657987, 435014756168760380909523387186194290, 759593815557626617904440619008375351308296, 2102438285027143559802785522708457578986076133973 (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^6)] Product_{j=1..n} 1/(1-x^j).

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

CROSSREFS

Column k=6 of A238016.

Sequence in context: A232456 A229932 A306723 * A006274 A230174 A060767

Adjacent sequences:  A238608 A238609 A238610 * A238612 A238613 A238614

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 18 09:39 EST 2020. Contains 332011 sequences. (Running on oeis4.)