A007709 Number of winning (or reformed) decks at Mousetrap.

1, 1, 2, 6, 15, 84, 330, 1812, 9978, 65503, 449719, 3674670, 28886593, 266242729, 2527701273, 25749021720

Offset: 1

Author

N. J. A. Sloane

Keywords

• nonn

References

• A. M. Bersani, "Reformed permutations in Mousetrap and its generalizations," Preprint Me.Mo.Mat. n. 15/2005.
• R. K. Guy, Unsolved Problems Number Theory, E37.
• 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.
• N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

• A. M. Bersani, On the game Mousetrap.
• R. K. Guy and R. J. Nowakowski, Mousetrap, Preprint, Feb 10 1993 [Annotated scanned copy]
• R. K. Guy and R. J. Nowakowski, Mousetrap Amer. Math. Monthly, 101 (1994), 1007-1010.

Crossrefs

Cf. A007710, A007711, A007712, A055459, A067950.

Extensions

Better description and more terms from Alberto M. Bersani (bersani(AT)dmmm.uniroma1.it), Feb 09 2007

One more term from Alberto M. Bersani (bersani(AT)dmmm.uniroma1.it), Feb 24 2008