[go: up one dir, main page]

login
A227764
Losing positions in the misere version of the Subtract-a-Prime game.
2
2, 3, 11, 12, 27, 36, 37, 51, 57, 87, 93, 102, 117, 123, 127, 135, 147, 157, 171, 177, 189, 197, 207, 219, 237, 249, 255, 261, 267, 291, 297, 303, 311, 312, 321, 327, 337, 345, 357, 363, 377, 387, 393, 397, 405, 417, 427, 447, 453, 471, 477, 483, 487, 495
OFFSET
1,1
COMMENTS
Consider the following game: two players make moves in turn; initially the number on the board is n. Each move consists of subtracting a prime number that is at most the number on the board. The player who cannot play wins. This sequence is the set of lost positions in this game.
MATHEMATICA
moves[n_] := Table[n - Prime[i], {i, 1, PrimePi[n]}]; gana[n_] := gana[n] = If[n < 2, True, ! Select[moves[n], !gana[#] &] == {}]; Select[Range[155], !gana[#] &]
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved