%I A032032
%S A032032 1,0,1,1,7,21,141,743,5699,42241,382153,3586155,38075247,428102117,
%T A032032 5257446533,68571316063,959218642651,14208251423433,
%U A032032 223310418094785,3699854395380371,64579372322979335
%N A032032 Number of ways to partition n labeled elements into sets of sizes of 
               at least 2 and order the sets.
%H A032032 C. G. Bower, <a href="transforms2.html">Transforms (2)</a>
%H A032032 <a href="Sindx_Par.html#partN">Index entries for related partition-counting 
               sequences</a>
%H A032032 P. Flajolet and R. Sedgewick, <a href="http://algo.inria.fr/flajolet/
               Publications/books.html">Analytic Combinatorics</a>, 2009; see page 
               245
%F A032032 "AIJ" (ordered, indistinct, labeled) transform of 0, 1, 1, 1...
%F A032032 E.g.f.: 1/(2+x-e^x).
%p A032032 spec := [ B, {B=Sequence(Set(Z,card>1))}, labeled ]; [seq(combstruct[count](spec, 
               size=n), n=1..30)];
%Y A032032 Sequence in context: A001693 A061961 A028248 this_sequence A084711 A060146 
               A111878
%Y A032032 Adjacent sequences: A032029 A032030 A032031 this_sequence A032033 A032034 
               A032035
%K A032032 nonn
%O A032032 0,5
%A A032032 Christian G. Bower (bowerc(AT)usa.net)