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!)
A238613 Number of partitions of n^8 into parts that are at most n. 2
1, 1, 129, 3590508, 1955134763464, 8085018247233663602, 154721208025657067873668152, 10114611726199237476675435354424104, 1841159754991692001851990839259642586671980, 805821524592736878546553406787954567208757510893718 (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^8)] Product_{j=1..n} 1/(1-x^j).

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

CROSSREFS

Column k=8 of A238016.

Sequence in context: A103347 A291505 A275097 * A113489 A297942 A298553

Adjacent sequences:  A238610 A238611 A238612 * A238614 A238615 A238616

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 25 04:32 EST 2020. Contains 332217 sequences. (Running on oeis4.)