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.
%I A239169 #9 Jul 19 2017 15:51:56
%S A239169 0,1,49,82834,6934032777,34711806631898612,11573466447067793596124382,
%T A239169 275570877432663678053361428346732364,
%U A239169 492094366103239904094628894222685729680850442491,68346513550765879549763426703232180189170804739067223698078512
%N A239169 Number of partitions of 10^n into parts that are at most n with at least one part of each size.
%H A239169 Alois P. Heinz, <a href="/A239169/b239169.txt">Table of n, a(n) for n = 0..33</a>
%H A239169 A. V. Sills and D. Zeilberger, <a href="https://arxiv.org/abs/1108.4391">Formulae for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz)</a> (arXiv:1108.4391 [math.CO])
%F A239169 a(n) = [x^(10^n-n*(n+1)/2)] Product_{j=1..n} 1/(1-x^j).
%F A239169 a(n) ~ 10^(n*(n-1)) / (n!*(n-1)!). - _Vaclav Kotesovec_, Jun 05 2015
%Y A239169 Column k=10 of A238012.
%K A239169 nonn
%O A239169 0,3
%A A239169 _Alois P. Heinz_, Mar 11 2014