|
Search: id:A145211
|
|
|
| A145211 |
|
Maximal number of distinct shuffles of the identity permutation on n letters with another permutation on n letters |
|
+0
1
|
| |
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
For n=4,5,6, the maximum number is achieved by the following permutations, respectively: 3412, 34512, 456123.
|
|
REFERENCES
|
C. Smith, dissertation, Harvard University, forthcoming.
|
|
EXAMPLE
|
For n=2, the distinct shuffles of 12 with 21 are: 1221, 1212, 2112, 2121.
|
|
CROSSREFS
|
Sequence in context: A162482 A000651 A118896 this_sequence A060898 A045501 A162481
Adjacent sequences: A145208 A145209 A145210 this_sequence A145212 A145213 A145214
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Camillia Smith (cammie(AT)math.harvard.edu), Oct 04 2008
|
|
|
Search completed in 0.002 seconds
|
