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 A143402 #16 May 14 2016 14:53:42
%S A143402 0,0,0,0,0,0,0,1,84,3990,141120,4138827,106469748,2484848080,
%T A143402 53791898160,1096912870053,21307466872692,397605494092170,
%U A143402 7173885616672320,125794299357058879,2152559266567924116,36065247772657686660,593280221500152370800
%N A143402 Expansion of x^k/Product_{t=k..2k} (1-tx) for k=7.
%C A143402 a(n) is also the number of forests of 7 labeled rooted trees of height at most 1, with n labels, where any root may contain >= 1 labels.
%H A143402 Alois P. Heinz, <a href="/A143402/b143402.txt">Table of n, a(n) for n = 0..300</a>
%H A143402 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%F A143402 G.f.: x^7/((1-7x)(1-8x)(1-9x)(1-10x)(1-11x)(1-12x)(1-13x)(1-14x)).
%F A143402 E.g.f.: exp(7*x)*((exp(x)-1)^7)/7!.
%p A143402 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(7): seq(a(n), n=0..30);
%Y A143402 7th column of A143395.
%K A143402 nonn
%O A143402 0,9
%A A143402 _Alois P. Heinz_, Aug 12 2008