|
Search: id:A067950
|
|
|
| A067950 |
|
a(n) = number of 3-times (but not 4-times) reformable permutation of {1,...,n}. |
|
+0
6
|
|
| 1, 0, 1, 8, 31, 56, 219, 605, 2485, 9697, 40571
(list; graph; listen)
|
|
|
OFFSET
|
6,4
|
|
|
REFERENCES
|
A. M. Bersani, "Reformed permutations in Mousetrap and its generalizations", preprint MeMoMat 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.
|
|
EXAMPLE
|
a(6)=1, 165342->132564->125346->136524
|
|
CROSSREFS
|
Cf. A007709, A007711, A007712, A055459.
Sequence in context: A055737 A098741 A027146 this_sequence A022273 A061294 A115293
Adjacent sequences: A067947 A067948 A067949 this_sequence A067951 A067952 A067953
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Kok Seng Chua (chuaks(AT)ihpc.nus.edu.sg), Mar 06 2002
|
|
EXTENSIONS
|
2 more terms from Alberto M. Bersani (bersani(AT)dmmm.uniroma1.it), Feb 07 2007
One more term from Alberto M. Bersani (bersani(AT)dmmm.uniroma1.it), Feb 24 2008
|
|
|
Search completed in 0.002 seconds
|
