|
| |
|
|
A028305
|
|
Triangle of numbers of permutations eliminating just k cards out of n in game of Mousetrap.
|
|
0
| |
|
|
1, 0, 1, 1, 0, 1, 2, 2, 0, 2, 9, 6, 3, 0, 6, 44, 31, 19, 11, 0, 15, 265, 180, 105, 54, 32, 0, 84, 1854, 1255, 771, 411, 281, 138, 0, 330
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,7
|
|
|
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.
R. K. Guy, Unsolved Problems Number Theory, E37.
S. Washburn, T. Marlowe and C. T. Ryan, Discrete Mathematics, Addison-Wesley, 1999, page 326.
|
|
|
CROSSREFS
| Sequence in context: A052422 A011218 A171244 * A137349 A087318 A087319
Adjacent sequences: A028302 A028303 A028304 * A028306 A028307 A028308
|
|
|
KEYWORD
| tabl,nonn,more
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
