login
A258303
Number of partitions of 3*n^3 into parts that are at most n.
5
1, 1, 13, 588, 53089, 7431069, 1432812535, 354709605775, 107681683621061, 38815870525676822, 16224696168627992214, 7722681288635179285337, 4126484069454572889453794, 2446850787696893234909546422, 1594892857383186062141424302309
OFFSET
0,3
LINKS
FORMULA
a(n) ~ exp(2*n + 1/12) * 3^(n-1) * n^(n-3) / (2*Pi).
MAPLE
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);
CROSSREFS
KEYWORD
nonn
AUTHOR
Vaclav Kotesovec, May 25 2015
STATUS
approved