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”).
%I #6 Jun 05 2015 17:00:16
%S 0,1,51,83834,6954866112,34732639965323612,11574681724845786651679939,
%T 275575507062293332528670070330578043,
%U 492095606182604983628979092635386202795929807572,68346538155515186680097859376764556127526656338966443473179293
%N Number of partitions of 10^n into parts that are at most n.
%H Alois P. Heinz, <a href="/A238567/b238567.txt">Table of n, a(n) for n = 0..33</a>
%F a(n) = [x^(10^n)] Product_{j=1..n} 1/(1-x^j).
%F a(n) ~ 10^(n*(n-1)) / (n!*(n-1)!). - _Vaclav Kotesovec_, Jun 05 2015
%Y Column k=10 of A238010.
%K nonn
%O 0,3
%A _Alois P. Heinz_, Feb 28 2014