|
%I #9 Sep 10 2016 03:14:12
%S 1,1,21,1587,238383,55567352,17847892852,7361757422695,
%T 3723968532118769,2236948326023829383,1558198571940473783110,
%U 1236019919143994867274825,1100668944858994534988670451,1087699749857592852109688615310,1181577954513871365541825872100466
%N Number of partitions of 5*n^3 into parts that are at most n.
%H Vaclav Kotesovec, <a href="/A258305/b258305.txt">Table of n, a(n) for n = 0..90</a>
%F a(n) ~ exp(2*n + 1/20) * 5^(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(5*n^3, n), n=0..20);
%Y Cf. A238608, A258302, A258303, A258304.
%K nonn
%O 0,3
%A _Vaclav Kotesovec_, May 25 2015
|
