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

1, 1, 3, 14, 108, 1115, 14800, 239691, 4602893, 102442041, 2596767156, 73937412122, 2338157235782, 81358388835166, 3090548185022616, 127310130911561966, 5654266354725389764, 269396637045530725099, 13708631585852580662781, 742141584297248778501411

Offset

0,3

Links

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

Formula

a(n) ~ exp(2*n + 9/2) * n^(n-3) / (2*Pi * 6^(n-1)).

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)/6, n), n=0..20);

Crossrefs

Cf. A238608, A258297, A258299, A258300, A258301.

Sequence in context: A051106 A246731 A349584 * A121951 A276751 A085244

Adjacent sequences: A258295 A258296 A258297 * A258299 A258300 A258301

Keyword

nonn

Author

Vaclav Kotesovec, May 25 2015

Status

approved