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!)
A238614 Number of partitions of n^9 into parts that are at most n. 2
1, 1, 257, 32294883, 125107148059080, 5052825953808096554227, 1203080775953722005263023646232, 1189959092808570377265545326042454670975, 3861166489120966379893685013624485791901912419888, 34687845413783594101366282545316028561007822069601179170488 (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^9)] Product_{j=1..n} 1/(1-x^j).

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

CROSSREFS

Column k=9 of A238016.

Sequence in context: A291506 A275098 A194155 * A308672 A308675 A121237

Adjacent sequences:  A238611 A238612 A238613 * A238615 A238616 A238617

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