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

1, 1, 1, 7, 169, 7166, 436140, 34690401, 3418486403, 402588217564, 55217486292383, 8650673262689142, 1524827150449505994, 298774748146352115019, 64436825369109396329518, 15171417879016739747222223, 3872658124805520661780283663, 1065387724298834666633864592587

Offset

0,4

Links

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

Formula

a(n) ~ exp(2*n - 11/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, A258297, A258298, A258300, A258301.

Sequence in context: A124126 A086373 A162131 * A012067 A012145 A368839

Adjacent sequences: A258296 A258297 A258298 * A258300 A258301 A258302

Keyword

nonn

Author

Vaclav Kotesovec, May 25 2015

Status

approved