|
| |
|
|
A018931
|
|
The number of permutations of n cards in which 2 is the first card hit and 3 the next hit after 2.
|
|
1
| | |
|
|
|
OFFSET
| 3,3
|
|
|
COMMENTS
| From the game of Mousetrap.
|
|
|
REFERENCES
| Mundfrom, Daniel J.; A problem in permutations: the game of `Mousetrap'. European J. Combin. 15 (1994), no. 6, 555-560.
|
|
|
LINKS
| D. J. Mundform, A problem of permutations: the Game of 'Moustrap', Eur. J. Combinat. 15 (1994) 555-560, Table 1.
|
|
|
FORMULA
| a(n) = A062119(n-3), n>4. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 02 2008
|
|
|
CROSSREFS
| Cf. A002468.
Sequence in context: A002670 A119921 A167747 * A062119 A052556 A052833
Adjacent sequences: A018928 A018929 A018930 * A018932 A018933 A018934
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| Changed offset to 3. Provided more precise definition. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 02 2008
|
| |
|
|
