|
Search: id:A091442
|
|
|
| A091442 |
|
Table (by antidiagonals) of permutations of two types of objects so that each cycle contains at least one object of each type. Each type of object unlabeled. |
|
+0
1
|
|
| 1, 1, 1, 1, 3, 1, 1, 3, 3, 1, 1, 5, 8, 5, 1, 1, 5, 11, 11, 5, 1, 1, 7, 17, 26, 17, 7, 1, 1, 7, 24, 40, 40, 24, 7, 1, 1, 9, 31, 66, 85, 66, 31, 9, 1, 1, 9, 39, 95, 146, 146, 95, 39, 9, 1, 1, 11, 50, 139, 245, 304, 245, 139, 50, 11, 1, 1, 11, 59, 183, 379, 538, 538, 379, 183, 59, 11
(list; table; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
REFERENCES
|
F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Cambridge, 1998, pg 114 (2.4.42)
|
|
FORMULA
|
G.f.: A(x, y) = Product_{k>=1} (1-x^n)*(1-y^n)/(1-x^n-y^n).
|
|
EXAMPLE
|
1 1 1 1 1 ...
1 3 3 5 5 ...
1 3 8 11 17 ...
1 5 11 26 40 ...
1 5 17 40 85 ...
|
|
CROSSREFS
|
Sequence in context: A143086 A152714 A134444 this_sequence A025834 A035649 A094782
Adjacent sequences: A091439 A091440 A091441 this_sequence A091443 A091444 A091445
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Christian G. Bower (bowerc(AT)usa.net), Jan 09 2004
|
|
|
Search completed in 0.002 seconds
|
