|
Search: id:A094315
|
|
|
| A094315 |
|
Triangle read by rows giving number of circular permutations of n letters such that all letters are displaced by no more than k places from their original position. |
|
+0
1
|
|
| 1, 0, 1, 0, 0, 2, 0, 0, 0, 6, 1, 0, 6, 8, 9, 2, 15, 20, 40, 30, 13, 20, 72, 180, 176, 180, 72, 20, 144, 609, 1106, 1421, 980, 595, 154, 31, 1265, 4960, 9292, 10352, 8326, 4096, 1676, 304, 49
(list; table; graph; listen)
|
|
|
OFFSET
|
0,6
|
|
|
COMMENT
|
The n-th row sums to n!.
|
|
REFERENCES
|
J. Riordan, Discordant permutations, Scripta Math., 20 (1954), 14-23.
Anthony C. Robin, Circular Wife Swapping, The Mathematical Gazette, November 2006.
|
|
CROSSREFS
|
Diagonals give A000183 (which has further references), A000476, A000388, A000380, A000440, etc.
Sequence in context: A132792 A136572 A053203 this_sequence A048146 A028973 A066503
Adjacent sequences: A094312 A094313 A094314 this_sequence A094316 A094317 A094318
|
|
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
|
