|
%I #4 Sep 17 2013 19:29:19
%S 1,10,110,1100,10725,104104,1016015,10032880,100643400,1028142830,
%T 10712984282,113961363880,1238298284860,13747432565790,
%U 155944562191220,1807325391776872,21396572780305250,258695925902828700,3193365395052825850,40233167990427412000
%N Number of set partitions of {1,...,n} with largest set of size 9.
%H Alois P. Heinz, <a href="/A229251/b229251.txt">Table of n, a(n) for n = 9..500</a>
%F E.g.f.: exp(Sum_{j=1..9} x^j/j!) - exp(Sum_{j=1..8} x^j/j!).
%p G:= proc(n, k) option remember; local j; if k>n then G(n, n)
%p elif n=0 then 1 elif k<1 then 0 else G(n-k, k);
%p for j from k-1 to 1 by -1 do %*(n-j)/j +G(n-j, k) od; % fi
%p end:
%p a:= n-> G(n,9)-G(n,8):
%p seq(a(n), n=9..30);
%Y Column k=9 of A080510.
%K nonn
%O 9,2
%A _Alois P. Heinz_, Sep 17 2013
|
