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

%I

%S 1,1,257,32294883,125107148059080,5052825953808096554227,

%T 1203080775953722005263023646232,

%U 1189959092808570377265545326042454670975,3861166489120966379893685013624485791901912419888,34687845413783594101366282545316028561007822069601179170488

%N Number of partitions of n^9 into parts that are at most n.

%H Alois P. Heinz, <a href="/A238614/b238614.txt">Table of n, a(n) for n = 0..60</a>

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

%F a(n) ~ exp(2*n) * n^(7*n-9) / (2*Pi). - _Vaclav Kotesovec_, May 25 2015

%Y Column k=9 of A238016.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Mar 01 2014

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 September 18 10:13 EDT 2021. Contains 347518 sequences. (Running on oeis4.)