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 #8 May 24 2018 12:12:42
%S 1,1,3,13,75,541,4683,47293,545835,7087261,102247563,1622632572,
%T 28091567570,526858347730,10641342953670,230283190536542,
%U 5315654669985946,130370766690581274,3385534653313192094,92801587015186096762,2677687786557636155446
%N Number of ordered set partitions of [n] with at most ten elements per block.
%H Alois P. Heinz, <a href="/A276930/b276930.txt">Table of n, a(n) for n = 0..424</a>
%F E.g.f.: 1/(1-Sum_{i=1..10} x^i/i!).
%p a:= proc(n) option remember; `if`(n=0, 1, add(
%p a(n-i)*binomial(n, i), i=1..min(n, 10)))
%p end:
%p seq(a(n), n=0..25);
%t max = 25; CoefficientList[1/(1-Sum[x^i/i!, {i, 1, 10}]) + O[x]^(max+1), x]* Range[0, max]! (* _Jean-François Alcover_, May 24 2018 *)
%Y Column k=10 of A276921.
%Y Cf. A229227.
%K nonn
%O 0,3
%A _Alois P. Heinz_, Sep 22 2016