A396181 - OEIS

A396181

Consider the square spiral with its cells numbered starting at 0, as in A308884 and A274641. Three players, X, Y, and Z, play in rotation, beginning with X. When it is a player's turn, he places a queen at the smallest unoccupied cell not attacked by an existing queen belonging to a different player. Sequence lists squares occupied by a Y queen.

9, 25, 26, 81, 84, 117, 165, 169, 170, 225, 226, 228, 285, 361, 362, 364, 368, 437, 519, 525, 529, 530, 532, 536, 615, 725, 729, 730, 732, 736, 831, 841, 842, 844, 848, 1079, 1089, 1092, 1096, 1209, 1215, 1221, 1353, 1365, 1369, 1370, 1376, 1503, 1511, 1521, 1522, 1524, 1528, 1663, 1665, 1677, 1839, 1849, 1850, 1852, 1856

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,1

COMMENTS

A396180-A396183 together partition the nonnegative integers.

LINKS

Jonas Karlsson, Table of n, a(n) for n = 0..19999

Michael S. Branicky, Python program for OEIS A396180-A396183

Michael S. Branicky, Illustration of central 2001 X 2001 square

Michael S. Branicky, Illustration of central 10001 X 10001 square

Jonas Karlsson, The initial cells of the spiral together with the first few queens.

Jonas Karlsson, Illustration showing 20K queens of each color.