cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

1, 1, 257, 32294883, 125107148059080, 5052825953808096554227, 1203080775953722005263023646232, 1189959092808570377265545326042454670975, 3861166489120966379893685013624485791901912419888, 34687845413783594101366282545316028561007822069601179170488
Offset: 0

Views

Author

Alois P. Heinz, Mar 01 2014

Keywords

Crossrefs

Column k=9 of A238016.

Formula

a(n) = [x^(n^9)] Product_{j=1..n} 1/(1-x^j).
a(n) ~ exp(2*n) * n^(7*n-9) / (2*Pi). - Vaclav Kotesovec, May 25 2015