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

1, 1, 3, 24, 297, 5260, 123755, 3648814, 129828285, 5425234114, 260818130929, 14194798070042, 863357482347465, 58068803644110427, 4281318749672322843, 343463734454952001605, 29792472711307060688049, 2778959190056157071592315, 277420695604265258419161136

Offset

0,3

Links

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

Formula

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

Crossrefs

Cf. A238608, A258297, A258298, A258299, A258300.

Sequence in context: A365998 A292186 A365567 * A365584 A138209 A352235

Adjacent sequences: A258298 A258299 A258300 * A258302 A258303 A258304

Keyword

nonn

Author

Vaclav Kotesovec, May 25 2015

Status

approved