0,3

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

Alois P. Heinz, Table of n, a(n) for n = 0..60

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

Column k=10 of A238016.

Sequence in context: A103351 A291507 A275099 * A213065 A045054 A301547

Adjacent sequences: A238612 A238613 A238614 * A238616 A238617 A238618

nonn

Alois P. Heinz, Mar 01 2014

approved