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 A258304 #6 May 27 2015 09:15:42 %S A258304 1,1,17,1027,123464,23030612,5918918145,1953335236481,790541795804221, %T A258304 379916850888632162,211720519858133280231,134359691058417334173117, %U A258304 95719564240981718602134049,75674822191817499226090337378,65766024754772296807292428860854 %N A258304 Number of partitions of 4*n^3 into parts that are at most n. %H A258304 Vaclav Kotesovec, <a href="/A258304/b258304.txt">Table of n, a(n) for n = 0..62</a> %F A258304 a(n) ~ exp(2*n + 1/16) * 4^(n-1) * n^(n-3) / (2*Pi). %p A258304 T:=proc(n,k) option remember; `if`(n=0 or k=1, 1, T(n,k-1) + `if`(n<k, 0, T(n-k,k))) end proc: seq(T(4*n^3, n), n=0..20); %Y A258304 Cf. A238608, A258302, A258303, A258305. %K A258304 nonn %O A258304 0,3 %A A258304 _Vaclav Kotesovec_, May 25 2015