A258300 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A258300

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

1, 1, 1, 1, 5, 30, 282, 3539, 55974, 1065947, 23785645, 608889106, 17594781914, 566603884871, 20123663539549, 781500841147604, 32946304088342094, 1498526109256063585, 73147202427442412812, 3814178439827570160925, 211598573411998923138880

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,5

LINKS

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

FORMULA

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

Sequence in context: A342389 A344525 A277464 * A276752 A052172 A058783

Adjacent sequences: A258297 A258298 A258299 * A258301 A258302 A258303

KEYWORD

nonn

AUTHOR

Vaclav Kotesovec, May 25 2015

STATUS

approved