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 A258303 #9 Sep 14 2016 03:39:05 %S A258303 1,1,13,588,53089,7431069,1432812535,354709605775,107681683621061, %T A258303 38815870525676822,16224696168627992214,7722681288635179285337, %U A258303 4126484069454572889453794,2446850787696893234909546422,1594892857383186062141424302309 %N A258303 Number of partitions of 3*n^3 into parts that are at most n. %H A258303 Vaclav Kotesovec, <a href="/A258303/b258303.txt">Table of n, a(n) for n = 0..100</a> %F A258303 a(n) ~ exp(2*n + 1/12) * 3^(n-1) * n^(n-3) / (2*Pi). %p A258303 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(3*n^3, n), n=0..20); %Y A258303 Cf. A238608, A258302, A258304, A258305. %K A258303 nonn %O A258303 0,3 %A A258303 _Vaclav Kotesovec_, May 25 2015