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

1, 1, 9, 271, 16335, 1525940, 196284041, 32409332818, 6561153029810, 1577073620254149, 439541281384464800, 139493983910450106067, 49695878602452933374813, 19646816226938989587513067, 8537966749269377751401117583, 4046350906270352192325991177139

Offset

0,3

Links

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

Formula

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

Crossrefs

Cf. A238608, A258303, A258304, A258305.

Sequence in context: A202689 A364438 A218693 * A336195 A028456 A180358

Adjacent sequences: A258299 A258300 A258301 * A258303 A258304 A258305

Keyword

nonn

Author

Vaclav Kotesovec, May 25 2015

Status

approved