The OEIS is supported by the many generous donors to the OEIS Foundation.

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

%I

%S 1,1,13,588,53089,7431069,1432812535,354709605775,107681683621061,

%T 38815870525676822,16224696168627992214,7722681288635179285337,

%U 4126484069454572889453794,2446850787696893234909546422,1594892857383186062141424302309

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

%H Vaclav Kotesovec, <a href="/A258303/b258303.txt">Table of n, a(n) for n = 0..100</a>

%F a(n) ~ exp(2*n + 1/12) * 3^(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(3*n^3, n), n=0..20);

%Y Cf. A238608, A258302, A258304, 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 25 03:31 EDT 2022. Contains 354835 sequences. (Running on oeis4.)