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!)
A258301 Number of partitions of n*(n+1)*(2n+1)/6 into parts that are at most n. 5
1, 1, 3, 24, 297, 5260, 123755, 3648814, 129828285, 5425234114, 260818130929, 14194798070042, 863357482347465, 58068803644110427, 4281318749672322843, 343463734454952001605, 29792472711307060688049, 2778959190056157071592315, 277420695604265258419161136 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
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
Sequence in context: A365998 A292186 A365567 * A365584 A138209 A352235
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 March 3 07:26 EST 2024. Contains 370499 sequences. (Running on oeis4.)