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!)
A238612 Number of partitions of n^7 into parts that are at most n. 2

%I

%S 1,1,65,399675,30569959880,12940003469288602,19900384510848921094632,

%T 85980297709044488588773397089,877979540384895591800176962368065072,

%U 18720322073127387624828552135278902045913865,759424638305250205001161810310150848799911916053194

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

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

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

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

%Y Column k=7 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 February 20 22:47 EST 2020. Contains 332086 sequences. (Running on oeis4.)