|
Search: id:A007709
|
|
|
| A007709 |
|
Number of winning (or reformed) decks at Mousetrap.
(Formerly M1608)
|
|
+0
6
|
|
| 1, 1, 2, 6, 15, 84, 330, 1812, 9978, 65503, 449719, 3674670, 28886593, 266242729, 2527701273, 25749021720
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
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, Unsolved Problems Number Theory, E37.
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,'' Amer. Math. Monthly, 101 (1994), 1007-1010.
|
|
LINKS
|
A. M. Bersani, On the game Mousetrap.
|
|
CROSSREFS
|
Cf. A007710, A007711, A007712, A055459, A067950.
Sequence in context: A027287 A003268 A009455 this_sequence A078328 A038111 A123475
Adjacent sequences: A007706 A007707 A007708 this_sequence A007710 A007711 A007712
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Better decsription 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
|
|
|
Search completed in 0.002 seconds
|
