cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A018931 The number of permutations of n cards in which 2 is the first card hit and 3 the next hit after 2.

Original entry on oeis.org

0, 1, 2, 12, 72, 480, 3600, 30240, 282240, 2903040, 32659200, 399168000, 5269017600, 74724249600, 1133317785600, 18307441152000, 313841848320000, 5690998849536000, 108840352997376000, 2189611807358976000, 46225138155356160000, 1021818843434188800000
Offset: 3

Views

Author

Keywords

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.

Crossrefs

Cf. A002468.

Formula

a(n) = A062119(n-3), n > 4. - R. J. Mathar, Oct 02 2008

Extensions

Offset changed to 3 and more precise definition provided by R. J. Mathar, Oct 02 2008