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

1, 1, 13, 588, 53089, 7431069, 1432812535, 354709605775, 107681683621061, 38815870525676822, 16224696168627992214, 7722681288635179285337, 4126484069454572889453794, 2446850787696893234909546422, 1594892857383186062141424302309

Offset

0,3

Links

Vaclav Kotesovec, Table of n, a(n) for n = 0..100

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

Cf. A238608, A258302, A258304, A258305.

Sequence in context: A168601 A142210 A109875 * A275045 A296951 A374605

Adjacent sequences: A258300 A258301 A258302 * A258304 A258305 A258306

Keyword

nonn

Author

Vaclav Kotesovec, May 25 2015

Status

approved