|
|
A238615
|
|
Number of partitions of n^10 into parts that are at most n.
|
|
2
|
|
|
1, 1, 513, 290594892, 8006513870533064, 3157977415776418319210477, 9355115500676554620340590943203672, 139997247522791157386395916200494707946968395, 8097446373533819684208223226876398545717123633973546819
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
In general, for m > 3, is "Number of partitions of n^m into parts that are at most n" asymptotic to exp(2*n) * n^((m-2)*n-m) / (2*Pi). - Vaclav Kotesovec, May 25 2015
|
|
LINKS
|
|
|
FORMULA
|
a(n) = [x^(n^10)] Product_{j=1..n} 1/(1-x^j).
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|