Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Sep 17 2013 19:33:00
%S 1,11,132,1430,15015,156156,1625624,17055896,181158120,1953517566,
%T 21426984722,239340203466,2724654560628,31626047962432,
%U 374383760685660,4520229252281160,55662052670665870,698975472340315170,8949358054013356980,116803043793523277190
%N Number of set partitions of {1,...,n} with largest set of size 10.
%H Alois P. Heinz, <a href="/A229252/b229252.txt">Table of n, a(n) for n = 10..500</a>
%F E.g.f.: exp(Sum_{j=1..10} x^j/j!) - exp(Sum_{j=1..9} 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,10)-G(n,9):
%p seq(a(n), n=10..30);
%Y Column k=10 of A080510.
%K nonn
%O 10,2
%A _Alois P. Heinz_, Sep 17 2013