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.

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

Original entry on oeis.org

1, 1, 129, 3590508, 1955134763464, 8085018247233663602, 154721208025657067873668152, 10114611726199237476675435354424104, 1841159754991692001851990839259642586671980, 805821524592736878546553406787954567208757510893718
Offset: 0

Views

Author

Alois P. Heinz, Mar 01 2014

Keywords

Crossrefs

Column k=8 of A238016.

Formula

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