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!)
A067950 a(n) = number of 3-times (but not 4-times) reformable permutation of {1,...,n}. 5
1, 0, 1, 8, 31, 56, 219, 605, 2485, 9697, 40571 (list; graph; refs; listen; history; text; internal format)
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 Erdős is Eighty. Bolyai Society Math. Studies, Vol. 1, pp. 193-206, 1993.

LINKS

Table of n, a(n) for n=6..16.

A. M. Bersani, On the game Mousetrap.

R. K. Guy and R. J. Nowakowski, Mousetrap Amer. Math. Monthly, 101 (1994), 1007-1010.

EXAMPLE

a(6)=1, 165342->132564->125346->136524.

CROSSREFS

Cf. A007709, A007711, A007712, A055459.

Sequence in context: A304130 A305479 A302306 * A303037 A230386 A022273

Adjacent sequences: A067947 A067948 A067949 * 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

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 January 31 21:13 EST 2023. Contains 359981 sequences. (Running on oeis4.)