login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A238567
Number of partitions of 10^n into parts that are at most n.
2
0, 1, 51, 83834, 6954866112, 34732639965323612, 11574681724845786651679939, 275575507062293332528670070330578043, 492095606182604983628979092635386202795929807572, 68346538155515186680097859376764556127526656338966443473179293
OFFSET
0,3
LINKS
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
CROSSREFS
Column k=10 of A238010.
Sequence in context: A208405 A208412 A198904 * A198251 A135531 A038777
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Feb 28 2014
STATUS
approved