|
Search: id:A028305
|
|
|
| A028305 |
|
Triangle of numbers of permutations eliminating just k cards out of n in game of Mousetrap. |
|
+0
1
|
|
| 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; listen)
|
|
|
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
|
Adjacent sequences: A028302 A028303 A028304 this_sequence A028306 A028307 A028308
Sequence in context: A099064 A052422 A011218 this_sequence A137349 A087318 A087319
|
|
KEYWORD
|
tabl,nonn,more
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
