login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A258304 Number of partitions of 4*n^3 into parts that are at most n. 5

%I

%S 1,1,17,1027,123464,23030612,5918918145,1953335236481,790541795804221,

%T 379916850888632162,211720519858133280231,134359691058417334173117,

%U 95719564240981718602134049,75674822191817499226090337378,65766024754772296807292428860854

%N Number of partitions of 4*n^3 into parts that are at most n.

%H Vaclav Kotesovec, <a href="/A258304/b258304.txt">Table of n, a(n) for n = 0..62</a>

%F a(n) ~ exp(2*n + 1/16) * 4^(n-1) * n^(n-3) / (2*Pi).

%p T:=proc(n,k) option remember; `if`(n=0 or k=1, 1, T(n,k-1) + `if`(n<k, 0, T(n-k,k))) end proc: seq(T(4*n^3, n), n=0..20);

%Y Cf. A238608, A258302, A258303, A258305.

%K nonn

%O 0,3

%A _Vaclav Kotesovec_, May 25 2015

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 19 04:39 EDT 2019. Contains 327187 sequences. (Running on oeis4.)