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 #13 May 02 2020 04:50:22
%S 0,0,0,1,4,20,90,455,2352,13132,76540,473660,3069220,20922330,
%T 149021600,1109629885,8604815520,69437698160,581661169640,
%U 5051885815603,45411759404560,421977921782270,4047693372023070,40034523497947132,407818256494533984,4274309903558446900
%N Number of set partitions of [n] such that at least one of the block sizes is 3.
%H Alois P. Heinz, <a href="/A328153/b328153.txt">Table of n, a(n) for n = 0..576</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%F E.g.f.: exp(exp(x)-1) - exp(exp(x)-1-x^3/6).
%F a(n) = A000110(n) - A124504(n).
%p b:= proc(n, k) option remember; `if`(n=0, 1, add(
%p `if`(j=k, 0, b(n-j, k)*binomial(n-1, j-1)), j=1..n))
%p end:
%p a:= n-> b(n, 0)-b(n, 3):
%p seq(a(n), n=0..27);
%t b[n_, k_] := b[n, k] = If[n==0, 1, Sum[If[j==k, 0, b[n-j, k] Binomial[n-1, j-1]], {j, 1, n}]];
%t a[n_] := b[n, 0] - b[n, 3];
%t a /@ Range[0, 27] (* _Jean-François Alcover_, May 02 2020, after Maple *)
%Y Column k=3 of A327884.
%Y Cf. A000110, A124504, A328155.
%K nonn
%O 0,5
%A _Alois P. Heinz_, Oct 05 2019