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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A258297 Number of partitions of n*(n+1)*(n+2) into parts that are at most n. 5
1, 1, 13, 331, 13561, 776594, 57773582, 5320252480, 586352480958, 75438829494131, 11116206652400681, 1848033852642973772, 342436117841931383400, 70020229273505952925559, 15667865938977592230047929, 3809417116914053901413289249, 1000291703885548521424635046427 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) ~ exp(2*n + 13/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
Sequence in context: A296018 A348087 A142543 * A266902 A029807 A097308
KEYWORD
nonn
AUTHOR
Vaclav Kotesovec, May 25 2015
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 24 17:27 EST 2024. Contains 370307 sequences. (Running on oeis4.)