|
Search: id:A032032
|
|
|
| A032032 |
|
Number of ways to partition n labeled elements into sets of sizes of at least 2 and order the sets. |
|
+0
4
|
|
| 1, 0, 1, 1, 7, 21, 141, 743, 5699, 42241, 382153, 3586155, 38075247, 428102117, 5257446533, 68571316063, 959218642651, 14208251423433, 223310418094785, 3699854395380371, 64579372322979335
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
LINKS
|
C. G. Bower, Transforms (2)
Index entries for related partition-counting sequences
P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009; see page 245
|
|
FORMULA
|
"AIJ" (ordered, indistinct, labeled) transform of 0, 1, 1, 1...
E.g.f.: 1/(2+x-e^x).
|
|
MAPLE
|
spec := [ B, {B=Sequence(Set(Z, card>1))}, labeled ]; [seq(combstruct[count](spec, size=n), n=1..30)];
|
|
CROSSREFS
|
Sequence in context: A001693 A061961 A028248 this_sequence A084711 A060146 A111878
Adjacent sequences: A032029 A032030 A032031 this_sequence A032033 A032034 A032035
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Christian G. Bower (bowerc(AT)usa.net)
|
|
|
Search completed in 0.002 seconds
|
