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 A046918 #16 Aug 22 2015 22:45:04 %S A046918 1,1,1,1,1,1,1,1,2,2,3,3,3,2,2,1,1,1,1,2,3,4,5,7,7,8,8,8,7,7,5,4,3,2, %T A046918 1,1,1,1,2,3,5,6,9,11,14,16,19,20,23,23,24,23,23,20,19,16,14,11,9,6,5, %U A046918 3,2,1,1,1,1,2,3,5,7,10,13,18,22,28,33,40,45,52,57,63,66,70,71 %N A046918 Triangle of coefficients of polynomials p(n), with p(3)=1, p(n) = (1 - t^(2*n - 4))*(1 - t^(2*n - 3))*p(n - 1)/((1 - t^(n - 3))*(1 - t^n)). %H A046918 J. Riordan, <a href="http://dx.doi.org/10.1016/S0021-9800(68)80032-8">The number of score sequences in tournaments</a>, J. Combin. Theory, 5 (1968), 87-89. [But beware errors.] %e A046918 1; %e A046918 1 + t + t^2 + t^3 + t^4 + t^5; %e A046918 t^10 + t^9 + 2*t^8 + 2*t^7 + 3*t^6 + 3*t^5 + 3*t^4 + 2*t^3 + 2*t^2 + t + 1; %e A046918 ... %p A046918 p := proc(n) option remember; if n = 3 then 1 else (1-t^(2*n-4))*(1-t^(2*n-3))*p(n-1)/((1-t^(n-3))*(1-t^n)); fi; end; %t A046918 p[3] = 1; p[n_] := p[n] = (1 - t^(2*n-4))*(1 - t^(2*n-3))*p[n-1]/((1 - t^(n-3))*(1 - t^n)) // Simplify; Table[ CoefficientList[ Series[p[n], {t, 0, n^3}], t], {n, 3, 8}] // Flatten (* _Jean-François Alcover_, Oct 25 2013 *) %Y A046918 Cf. A046919. %K A046918 nonn,easy,nice,tabf %O A046918 3,9 %A A046918 _N. J. A. Sloane_ %E A046918 Keyword tabf by _Michel Marcus_, Dec 05 2014