OFFSET
1,2
COMMENTS
There is a subtle point about the definition. Because the players take turns in placing a knight, the spiral is not filled in consecutively. To obtain the sequence, one must first fill in the whole spiral, and then return to the start, and record the Red knights that are encountered as one walks along the spiral.
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..50000
Michael S. Branicky, Python program for OEIS A392182 and A392183
Michael S. Branicky, The first 10^4 filled cells of the spiral
Michael S. Branicky, The first 10^6 filled cells of the spiral
Michael S. Branicky, The first 4*10^6 filled cells of the spiral
Michael S. Branicky, The first 64*10^6 filled cells of the spiral
N. J. A. Sloane, The playing field: The square spiral in the first quadrant, with initial square labeled 0.
N. J. A. Sloane, Squares 0 to 100 of the spiral. [Black circle = Black knight, red circle = Red knight, black slash = attacked by a Black knight, red slash = attacked by a Red knight.]
PROG
(Python) # see linked program
CROSSREFS
KEYWORD
nonn
AUTHOR
Michael S. Branicky and N. J. A. Sloane, Feb 14 2026
STATUS
approved
