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 A238612 #8 May 25 2015 10:19:33
%S A238612 1,1,65,399675,30569959880,12940003469288602,19900384510848921094632,
%T A238612 85980297709044488588773397089,877979540384895591800176962368065072,
%U A238612 18720322073127387624828552135278902045913865,759424638305250205001161810310150848799911916053194
%N A238612 Number of partitions of n^7 into parts that are at most n.
%H A238612 Alois P. Heinz, <a href="/A238612/b238612.txt">Table of n, a(n) for n = 0..60</a>
%F A238612 a(n) = [x^(n^7)] Product_{j=1..n} 1/(1-x^j).
%F A238612 a(n) ~ exp(2*n) * n^(5*n-7) / (2*Pi). - _Vaclav Kotesovec_, May 25 2015
%Y A238612 Column k=7 of A238016.
%K A238612 nonn
%O A238612 0,3
%A A238612 _Alois P. Heinz_, Mar 01 2014