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.

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

Original entry on oeis.org

1, 1, 33, 44652, 478968264, 20735819929227, 2561606354507677872, 731267824140098782358035, 418829370245413954052212657987, 435014756168760380909523387186194290, 759593815557626617904440619008375351308296, 2102438285027143559802785522708457578986076133973
Offset: 0

Views

Author

Alois P. Heinz, Mar 01 2014

Keywords

Crossrefs

Column k=6 of A238016.

Formula

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