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.

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

Original entry on oeis.org

0, 1, 51, 83834, 6954866112, 34732639965323612, 11574681724845786651679939, 275575507062293332528670070330578043, 492095606182604983628979092635386202795929807572, 68346538155515186680097859376764556127526656338966443473179293
Offset: 0

Views

Author

Alois P. Heinz, Feb 28 2014

Keywords

Crossrefs

Column k=10 of A238010.

Formula

a(n) = [x^(10^n)] Product_{j=1..n} 1/(1-x^j).
a(n) ~ 10^(n*(n-1)) / (n!*(n-1)!). - Vaclav Kotesovec, Jun 05 2015