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!)
A258302 Number of partitions of 2*n^3 into parts that are at most n. 5
1, 1, 9, 271, 16335, 1525940, 196284041, 32409332818, 6561153029810, 1577073620254149, 439541281384464800, 139493983910450106067, 49695878602452933374813, 19646816226938989587513067, 8537966749269377751401117583, 4046350906270352192325991177139 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) ~ exp(2*n + 1/8) * 2^(n-1) * 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(2*n^3, n), n=0..20);
CROSSREFS
Sequence in context: A202689 A364438 A218693 * A336195 A028456 A180358
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 April 22 01:34 EDT 2024. Contains 371887 sequences. (Running on oeis4.)