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 A132466 #1 Dec 09 2007 03:00:00
%S A132466 0,0,0,0,0,0,0,1,80,1944,25200,217800,1411344,7361640,32391216,
%T A132466 124227675,425339200,1323786464,3797876160,10155802176,25539739200,
%U A132466 60844672800,138154965696,300509773245,628886888784,1270898695000,2488029830000,4731583685400,8762192010000
%N A132466 Let df(n,k) = Product_{i=0..k-1} (n-i) be the descending factorial and let P(m,n) = df(n-1,m-1)^2*(2*n-m)/((m-1)!*m!). Sequence gives P(8,n).
%Y A132466 See A132458 for further information.
%K A132466 nonn
%O A132466 1,9
%A A132466 Ottavio D'Antona (dantona(AT)dico.unimi.it), Oct 31 2007