|
Search: id:A007711
|
|
|
| A007711 |
|
Number of unreformed permutations of {1,...,n}.
(Formerly M3546)
|
|
+0
6
|
|
| 1, 1, 4, 18, 105, 636, 4710, 38508, 352902, 3563297, 39467081, 475326930, 6198134207, 86912048471, 1305146666727, 20897040866280
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
A. M. Bersani, "Reformed permutations in Mousetrap and its generalizations", preprint MeMoMat n. 15/2005.
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 and R. J. Nowakowski, ``Mousetrap,'' Amer. Math. Monthly, 101 (1994), 1007-1010.
|
|
LINKS
|
A. M. Bersani, On the game Mousetrap.
|
|
EXAMPLE
|
For n=3 the 4 unreformed permutations are 123,231,312,213. So a(3)=4 Also 132->123, 321->213 are reformable.
|
|
CROSSREFS
|
Cf. A007709, A007712, A055459, A067950.
Adjacent sequences: A007708 A007709 A007710 this_sequence A007712 A007713 A007714
Sequence in context: A137958 A064852 A051827 this_sequence A020114 A009597 A060223
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Kok Seng Chua (chuaks(AT)ihpc.nus.edu.sg), Mar 06 2002
2 more terms from Alberto M. Bersani (bersani(AT)dmmm.uniroma1.it), Feb 07 2007
One more term from Alberto M. Bersani (bersani(AT)dmmm.uniroma1.it), Feb 24 2008
|
|
|
Search completed in 0.002 seconds
|
