|
Search: id:A127966
|
|
|
| A127966 |
|
a(n) = number of 4-times (but not 5-times) reformable permutation of {1,...,n}. |
|
+0
1
|
| |
|
|
OFFSET
|
11,1
|
|
|
COMMENT
|
For n=16 we have the first example of a 5-reformed (but not 6-reformed) permutation: 1, 16, 12, 15, 6, 8, 14, 10, 9, 3, 4, 11, 13, 2, 7, 5 - Alberto M. Bersani (bersani(AT)dmmm.uniroma1.it), Feb 24 2008
|
|
REFERENCES
|
A. M. Bersani, ``Reformed permutations in Mousetrap and its generalizations,'' Preprint Me.Mo.Mat. n. 15/2005.
R. K. Guy and R. J. Nowakowski, ``Mousetrap,'' in D. Miklos, V.T. Sos and T. Szonyi, eds., Combinatorics, Paul Erdos is Eighty. Bolyai Society Math. Studies, Vol. 1, pp. 193-206, 1993.
R. K. Guy and R. J. Nowakowski, ``Mousetrap,'' Amer. Math. Monthly, 101 (1994), 1007-1010.
|
|
LINKS
|
A. M. Bersani, On the game Mousetrap.
|
|
CROSSREFS
|
Cf. A007709, A007710, A007711, A007712, A055459, A067950.
Adjacent sequences: A127963 A127964 A127965 this_sequence A127967 A127968 A127969
Sequence in context: A094424 A083677 A075803 this_sequence A110243 A088347 A069568
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Alberto M. Bersani (bersani(AT)dmmm.uniroma1.it), Feb 09 2007
|
|
EXTENSIONS
|
One more term from Alberto M. Bersani (bersani(AT)dmmm.uniroma1.it), Feb 24 2008
|
|
|
Search completed in 0.002 seconds
|
