login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A127966 a(n) = number of 4-times (but not 5-times) reformable permutation of {1,...,n}. 0
2, 1, 1, 4, 14, 57 (list; graph; refs; listen; history; text; internal format)
OFFSET
11,1
COMMENTS
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 Erdős is Eighty. Bolyai Society Math. Studies, Vol. 1, pp. 193-206, 1993.
LINKS
A. M. Bersani, On the game Mousetrap.
R. K. Guy and R. J. Nowakowski, Mousetrap, Amer. Math. Monthly, 101 (1994), 1007-1010.
CROSSREFS
Sequence in context: A166888 A083677 A075803 * A326570 A184880 A257859
KEYWORD
nonn,more
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
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 16:34 EDT 2024. Contains 371254 sequences. (Running on oeis4.)