OFFSET
1,2
COMMENTS
The game is played with two players alternatingly removing or adding chips on a heap. If C denotes the number of chips on the heap, a player must either put or take the largest possible square number of chips in his move, C -> C +- A048760(C). The player capable of taking all chips wins. The P positions are numbers of chips where the player to draw first will lose (assuming the opponent has a full analysis of the game). - R. J. Mathar, May 06 2016
REFERENCES
R. K. Guy, Unsolved Problems in Number Theory, E26.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
E. R. Berlekamp, J. H. Conway, R. K. Guy, Gewinnen (Strategien fur mathematische Spiele), Vieweg, (1986) p. 58.
R. K. Guy, Letter to N. J. A. Sloane, Aug 1975.
EXAMPLE
5 is a term because either putting 4 or taking 4 leads to squares (9 or 1) and the opponent wins by taking.
20 is a term because either putting 16 or taking 16 leads to squares (36 or 4) and the opponent wins by taking.
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved