A238612 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A238612

Number of partitions of n^7 into parts that are at most n.

1, 1, 65, 399675, 30569959880, 12940003469288602, 19900384510848921094632, 85980297709044488588773397089, 877979540384895591800176962368065072, 18720322073127387624828552135278902045913865, 759424638305250205001161810310150848799911916053194

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

LINKS

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

FORMULA

a(n) = [x^(n^7)] Product_{j=1..n} 1/(1-x^j).

a(n) ~ exp(2*n) * n^(5*n-7) / (2*Pi). - Vaclav Kotesovec, May 25 2015

CROSSREFS

Column k=7 of A238016.

Sequence in context: A171706 A015072 A015039 * A185823 A035519 A368189

Adjacent sequences: A238609 A238610 A238611 * A238613 A238614 A238615

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Mar 01 2014

STATUS

approved