A258297 Number of partitions of n*(n+1)*(n+2) into parts that are at most n.

1, 1, 13, 331, 13561, 776594, 57773582, 5320252480, 586352480958, 75438829494131, 11116206652400681, 1848033852642973772, 342436117841931383400, 70020229273505952925559, 15667865938977592230047929, 3809417116914053901413289249, 1000291703885548521424635046427

Offset

0,3

Links

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

Formula

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

Crossrefs

Cf. A238608, A258298, A258299, A258300, A258301.

Sequence in context: A296018 A348087 A142543 * A266902 A029807 A372182

Adjacent sequences: A258294 A258295 A258296 * A258298 A258299 A258300

Keyword

nonn

Author

Vaclav Kotesovec, May 25 2015

Status

approved