|
Search: id:A161173
|
|
|
| A161173 |
|
a(n) is the order (or period) of the "Cat's" permutation applied to a list of n objects. |
|
+0
2
|
|
| 1, 1, 3, 3, 2, 4, 6, 10, 6, 10, 14, 12, 30, 36, 24, 14, 12, 56, 55, 66, 10, 60, 14, 110, 198, 126, 140, 133, 105, 78, 105, 18, 18, 110, 60, 396, 93, 552, 120, 616, 276, 345, 43, 108, 1121, 204, 702, 1904, 138, 598, 2310, 1080, 132, 330
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
The Cat's permutation is done as follows. Start with a packet of n cards (numbered 1 to n from top to bottom), and deal them into two piles, first to yourself (pile B), and then to a spectator (pile A), saying "Me, you," silently to yourself over and over. Pick up pile B and deal again, first to yourself, forming a new pile B, and then to the spectator, thereby adding to the existing pile A. Repeat, picking up the diminished pile B, and dealing "Me, you" as before. Eventually, just one card remains in pile B; place it on top of pile A. The sequence of the cards in pile A determines the Cat's permutation ("Me, you" said fast sounds like something a cat says).
|
|
LINKS
|
Colm Mulcahy, The Yummie Deal and Variations , Card Colm, MAA Online, April 2009
|
|
EXAMPLE
|
a(9) = 6, because when the Cat's permutation is applied to {1,2,3,4,5,6,7,8,9} we get {9,1,5,3,7,8,6,4,2}, which corresponds to the product of a disjoint six cycle and a three cycle, and hence has order LCM(6,3)=6.
|
|
CROSSREFS
|
Cf. A161172
Sequence in context: A106686 A106702 A057435 this_sequence A050610 A151848 A117937
Adjacent sequences: A161170 A161171 A161172 this_sequence A161174 A161175 A161176
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Colm Mulcahy (colm(AT)spelman.edu), Jun 04 2009, Jun 07 2009
|
|
|
Search completed in 0.002 seconds
|
