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.

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

Original entry on oeis.org

0, 1, 41, 44652, 1965803130, 4223556692359571, 490686876939553950148311, 3299362171812031624458362654344896, 1347816410652573760215295879527613786555869189, 34687845413783594101366282545316028561007822069601179170488
Offset: 0

Views

Author

Alois P. Heinz, Feb 28 2014

Keywords

Crossrefs

Column k=9 of A238010.

Formula

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