login
The OEIS is supported by the many generous donors to the OEIS 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

%I #8 May 25 2015 10:21:03

%S 1,1,129,3590508,1955134763464,8085018247233663602,

%T 154721208025657067873668152,10114611726199237476675435354424104,

%U 1841159754991692001851990839259642586671980,805821524592736878546553406787954567208757510893718

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

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

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

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

%Y Column k=8 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 08:08 EDT 2024. Contains 371769 sequences. (Running on oeis4.)