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!)
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).
a(n) ~ exp(2*n) * n^(8*n-10) / (2*Pi). - Vaclav Kotesovec, May 25 2015
CROSSREFS
Column k=10 of A238016.
Sequence in context: A103351 A291507 A275099 * A213065 A045054 A301547
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Mar 01 2014
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 28 22:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)