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 A239167 #9 Jul 19 2017 15:51:28
%S A239167 0,1,31,21590,475473009,399953578562811,14325140434481169064975,
%T A239167 23442235543128214521886383970201,
%U A239167 1841132100297745277187328924904656111127054,7197719612276659958196058354497691622150052900765626132
%N A239167 Number of partitions of 8^n into parts that are at most n with at least one part of each size.
%H A239167 Alois P. Heinz, <a href="/A239167/b239167.txt">Table of n, a(n) for n = 0..35</a>
%H A239167 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 A239167 a(n) = [x^(8^n-n*(n+1)/2)] Product_{j=1..n} 1/(1-x^j).
%F A239167 a(n) ~ 8^(n*(n-1)) / (n!*(n-1)!). - _Vaclav Kotesovec_, Jun 05 2015
%Y A239167 Column k=8 of A238012.
%K A239167 nonn
%O A239167 0,3
%A A239167 _Alois P. Heinz_, Mar 11 2014