|
Search: id:A094314
|
|
|
| A094314 |
|
Triangle read by rows: T(n,k) = number of ways of seating n couples around a circular table so that exactly k married couples are adjacent (0 <= k <= n). |
|
+0
2
|
|
| 1, 0, 1, 0, 0, 2, 1, 0, 3, 2, 2, 8, 4, 8, 2, 13, 30, 40, 20, 15, 2, 80, 192, 210, 152, 60, 24, 2, 579, 1344, 1477, 994, 469, 140, 35, 2, 4738, 10800, 11672, 7888, 3660, 1232, 280, 48, 2
(list; table; graph; listen)
|
|
|
OFFSET
|
0,6
|
|
|
COMMENT
|
The men and women alternate. The n-th row sums to n!.
|
|
REFERENCES
|
Anthony C. Robin, Circular Wife Swapping, The Mathematical Gazette, November 2006.
|
|
CROSSREFS
|
Essentially a mirror image of A058087, which has much more information. Diagonals give A000179, A000425, A000033, A000159, A000181, etc.
Adjacent sequences: A094311 A094312 A094313 this_sequence A094315 A094316 A094317
Sequence in context: A019586 A063942 A106384 this_sequence A036864 A058604 A072661
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
njas, based on a suggestion from Anthony Robin (anthony_robin(AT)hotmail.com), Jun 02 2004
|
|
|
Search completed in 0.002 seconds
|
