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 A229250 #4 Sep 17 2013 19:22:43 %S A229250 1,9,90,825,7425,66924,609609,5643495,53275365,513949865,5072383602, %T A229250 51247279161,530162317815,5616049288500,60907673202255, %U A229250 676114396423257,7679484722988045,89216205660482175,1059689275333095550,12863300130089805825,159506272335882076605 %N A229250 Number of set partitions of {1,...,n} with largest set of size 8. %H A229250 Alois P. Heinz, <a href="/A229250/b229250.txt">Table of n, a(n) for n = 8..500</a> %F A229250 E.g.f.: exp(Sum_{j=1..8} x^j/j!) - exp(Sum_{j=1..7} x^j/j!). %p A229250 G:= proc(n, k) option remember; local j; if k>n then G(n, n) %p A229250 elif n=0 then 1 elif k<1 then 0 else G(n-k, k); %p A229250 for j from k-1 to 1 by -1 do %*(n-j)/j +G(n-j, k) od; % fi %p A229250 end: %p A229250 a:= n-> G(n,8)-G(n,7): %p A229250 seq(a(n), n=8..30); %Y A229250 Column k=8 of A080510. %K A229250 nonn %O A229250 8,2 %A A229250 _Alois P. Heinz_, Sep 17 2013