The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A018931 The number of permutations of n cards in which 2 is the first card hit and 3 the next hit after 2. 1
0, 1, 2, 12, 72, 480, 3600, 30240, 282240, 2903040, 32659200, 399168000, 5269017600, 74724249600, 1133317785600, 18307441152000, 313841848320000, 5690998849536000, 108840352997376000, 2189611807358976000, 46225138155356160000, 1021818843434188800000 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,3
COMMENTS
From the game of Mousetrap.
REFERENCES
Daniel J. Mundfrom, A problem in permutations: the game of "Mousetrap". European J. Combin. 15 (1994), no. 6, 555-560.
LINKS
D. J. Mundfrom, A problem of permutations: the Game of "Mousetrap", Eur. J. Combinat. 15 (1994) 555-560, Table 1.
FORMULA
a(n) = A062119(n-3), n > 4. - R. J. Mathar, Oct 02 2008
CROSSREFS
Cf. A002468.
Sequence in context: A322276 A279154 A167747 * A062119 A181966 A052556
KEYWORD
nonn
AUTHOR
EXTENSIONS
Offset changed to 3 and more precise definition provided by R. J. Mathar, Oct 02 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 May 14 17:50 EDT 2024. Contains 372533 sequences. (Running on oeis4.)