cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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

Views

Author

Vaclav Kotesovec, May 25 2015

Keywords

Crossrefs

Programs

  • Maple
    T:=proc(n,k) option remember; `if`(n=0 or k=1, 1, T(n,k-1) + `if`(n
    				

Formula

a(n) ~ exp(2*n + 13/4) * n^(n-3) / (2*Pi).