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 A071211 #7 Jun 27 2013 08:07:23
%S A071211 1,3,1,16,8,3,125,75,40,16,1296,864,540,300,125,16807,12005,8232,5292,
%T A071211 3024,1296,262144,196608,143360,100352,65856,38416,16807,4782969,
%U A071211 3720087,2834352,2099520,1492992,995328,589824,262144,100000000
%N A071211 Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the label k of the root.
%D A071211 C. Chauve, S. Dulucq and O. Guibert, Enumeration of some labeled trees, Proceedings of FPSAC/SFCA 2000 (Moscow), Springer, pp. 146-157.
%F A071211 T(n,k) = (n-k)*(n+1)^(n-k-1)*n^(k-1).
%p A071211 T:= (n, k)-> (n-k)*(n+1)^(n-k-1)*n^(k-1):
%p A071211 seq(seq(T(n, k), k=0..n-1), n=1..10);
%o A071211 (PARI) tabl(nn) = {for (n=1, nn, for (k=0, n-1, print1((n-k)*(n+1)^(n-k-1)*n^(k-1), ", ");); print(););} \\ _Michel Marcus_, Jun 27 2013
%Y A071211 Cf. A000312, A000272 (first column).
%K A071211 easy,nonn,tabl
%O A071211 1,2
%A A071211 Cedric Chauve (chauve(AT)lacim.uqam.ca), May 16 2002