|
| |
|
|
A002468
|
|
The game of Mousetrap with n cards.
(Formerly M2945 N1186)
|
|
6
| |
|
|
0, 0, 1, 3, 13, 65, 397, 2819, 22831, 207605, 2094121, 23205383, 280224451, 3662810249, 51523391965, 776082247979, 12463259986087, 212573743211549, 3837628837381201
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
COMMENTS
| The subsequence of primes begins: 3, 13, 397, 2819, no more through a(19) [Jonathan Vos Post, Feb 1, 2011].
|
|
|
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.
Mundfrom, Daniel J.; A problem in permutations: the game of `Mousetrap'. European J. Combin. 15 (1994), no. 6, 555-560.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
A. Steen, Some formulae respecting the game of mousetrap, Quart. J. Pure Applied Math., 15 (1878), 230-241.
|
|
|
LINKS
| Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
|
CROSSREFS
| Cf. A002467-A002469, A028306, etc.
Sequence in context: A009102 A080227 A199143 * A198663 A156181 A112807
Adjacent sequences: A002465 A002466 A002467 * A002469 A002470 A002471
|
|
|
KEYWORD
| nonn,easy,nice
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
