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 A143403 #15 May 14 2016 14:53:19
%S A143403 0,0,0,0,0,0,0,0,1,108,6510,289080,10550067,335170836,9597839680,
%T A143403 253489991040,6275077781973,147318890173884,3309320153700210,
%U A143403 71623038281001480,1501654449863348119,30633757929391948452,610246760750629071300,11906371167306982146000
%N A143403 Expansion of x^k/Product_{t=k..2k} (1-tx) for k=8.
%C A143403 a(n) is also the number of forests of 8 labeled rooted trees of height at most 1 with n labels, where any root may contain >= 1 labels.
%H A143403 Alois P. Heinz, <a href="/A143403/b143403.txt">Table of n, a(n) for n = 0..250</a>
%H A143403 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%F A143403 G.f.: x^8/((1-8x)(1-9x)(1-10x)(1-11x)(1-12x)(1-13x)(1-14x)(1-15x)(1-16x)).
%F A143403 E.g.f.: exp(8*x)*((exp(x)-1)^8)/8!.
%p A143403 a:= proc(k::nonnegint) local M; M:= Matrix(k+1, (i,j)-> if (i=j-1) then 1 elif j=1 then [seq(-1* coeff(product(1-t*x, t=k..2*k), x,u), u=1..k+1)][i] else 0 fi); p-> (M^p)[1,k+1] end(8); seq(a(n), n=0..27);
%Y A143403 8th column of A143395.
%K A143403 nonn
%O A143403 0,10
%A A143403 _Alois P. Heinz_, Aug 12 2008