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.

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

Original entry on oeis.org

1, 1, 65, 399675, 30569959880, 12940003469288602, 19900384510848921094632, 85980297709044488588773397089, 877979540384895591800176962368065072, 18720322073127387624828552135278902045913865, 759424638305250205001161810310150848799911916053194
Offset: 0

Views

Author

Alois P. Heinz, Mar 01 2014

Keywords

Crossrefs

Column k=7 of A238016.

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