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 A230050 #5 Oct 06 2013 19:47:51
%S A230050 1,1,2,10,65,564,6191,82050,1295263,23764278,499547080,11892550569,
%T A230050 317112508944,9392408105655,306739296397827,10973970687363844,
%U A230050 427724034697254939,18073023112616933860,824247511186225346295,40415810147764633887442,2123162727678797736474583
%N A230050 G.f.: Sum_{n>=0} x^n / (1-x)^(n^3).
%F A230050 a(n) = Sum_{k=0..n} binomial(k^3 + n-k-1, n-k).
%F A230050 Equals row sums of triangle A230049.
%e A230050 G.f.: A(x) = 1 + x + 2*x^2 + 10*x^3 + 65*x^4 + 564*x^5 + 6191*x^6 + 82050*x^7 +...
%e A230050 where
%e A230050 A(x) = 1 + x/(1-x) + x^2/(1-x)^8 + x^3/(1-x)^27 + x^4/(1-x)^64 + x^5/(1-x)^125 + x^6/(1-x)^216 + x^7/(1-x)^343 +...
%o A230050 (PARI) {a(n)=polcoeff(sum(k=0,n,x^k/(1-x+x*O(x^n))^(k^3)),n)}
%o A230050 for(n=0,25,print1(a(n),", "))
%o A230050 (PARI) {a(n)=sum(k=0,n,binomial(k^3+n-k-1, n-k))}
%o A230050 for(n=0,25,print1(a(n),", "))
%Y A230050 Cf. A230049, A178325, A227934, A227935.
%K A230050 nonn
%O A230050 0,3
%A A230050 _Paul D. Hanna_, Oct 06 2013