A396332 - OEIS

%I #17 May 27 2026 11:13:09

%S 2,5,8,9,15,16,21,25,29,32,36,40,42,48,55,57,58,63,70,74,82,86,88,90,

%T 91,95,97,101,103,107,109,111,113,128,130,132,136,142,143,145,151,153,

%U 156,158,161,169,173,175,177,183,185,191,196,198,200,206,208,209

%N Consider the square spiral with its cells numbered starting at 0. Three players, Red, Green and Blue, take turns and place knights at the smallest unoccupied cell not attacked by an opposing knight, where Red is only opposed by Blue, Green by Red and Blue by Green. Sequence lists squares occupied by a Blue knight.

%C See A396330.

%H Michael S. Branicky, <a href="/A396332/b396332.txt">Table of n, a(n) for n = 1..10000</a>

%H Michael S. Branicky, <a href="/A396330/a396330_1.py.txt">Python program for OEIS A396330, A396331 and A396332</a>

%H Nick J. Nauta, <a href="/A396330/a396330_6.png">The first 1000 cells of the spiral</a>

%H Nick J. Nauta, <a href="/A396330/a396330_7.png">The first 10000 cells of the spiral</a>

%H Nick J. Nauta, <a href="/A396330/a396330_8.png">The first 100000 cells of the spiral</a>

%H Nick J. Nauta, <a href="/A396330/a396330_9.png">The first 1000000 cells of the spiral</a>

%o (Python) # See Links section.

%Y Cf. A392177, A395647, A396330, A396331.

%K nonn

%O 1,1

%A _Nick J. Nauta_, May 22 2026