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 A238613 #8 May 25 2015 10:21:03
%S A238613 1,1,129,3590508,1955134763464,8085018247233663602,
%T A238613 154721208025657067873668152,10114611726199237476675435354424104,
%U A238613 1841159754991692001851990839259642586671980,805821524592736878546553406787954567208757510893718
%N A238613 Number of partitions of n^8 into parts that are at most n.
%H A238613 Alois P. Heinz, <a href="/A238613/b238613.txt">Table of n, a(n) for n = 0..60</a>
%F A238613 a(n) = [x^(n^8)] Product_{j=1..n} 1/(1-x^j).
%F A238613 a(n) ~ exp(2*n) * n^(6*n-8) / (2*Pi). - _Vaclav Kotesovec_, May 25 2015
%Y A238613 Column k=8 of A238016.
%K A238613 nonn
%O A238613 0,3
%A A238613 _Alois P. Heinz_, Mar 01 2014