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 A258300 #6 May 27 2015 09:17:28 %S A258300 1,1,1,1,5,30,282,3539,55974,1065947,23785645,608889106,17594781914, %T A258300 566603884871,20123663539549,781500841147604,32946304088342094, %U A258300 1498526109256063585,73147202427442412812,3814178439827570160925,211598573411998923138880 %N A258300 Number of partitions of n*(n-1)*(n-2)/6 into parts that are at most n. %H A258300 Vaclav Kotesovec, <a href="/A258300/b258300.txt">Table of n, a(n) for n = 0..141</a> %F A258300 a(n) ~ exp(2*n - 3/2) * n^(n-3) / (2*Pi * 6^(n-1)). %p A258300 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(n*(n-1)*(n-2)/6, n), n=0..20); %Y A258300 Cf. A238608, A258297, A258298, A258299, A258301. %K A258300 nonn %O A258300 0,5 %A A258300 _Vaclav Kotesovec_, May 25 2015