login
Consider the square spiral with its cells numbered starting at 0. Four players take turns and place knights at the smallest unoccupied cell not attacked by an existing knight of a different player. Sequence lists squares occupied by the third player.
6

%I #5 May 20 2026 21:25:40

%S 2,5,20,38,43,56,57,62,65,70,88,90,104,105,112,114,127,131,152,163,

%T 176,182,184,190,195,202,230,232,234,236,238,258,261,280,282,295,297,

%U 299,305,332,336,344,354,370,372,374,380,382,390,394,399,406,416,430,448

%N Consider the square spiral with its cells numbered starting at 0. Four players take turns and place knights at the smallest unoccupied cell not attacked by an existing knight of a different player. Sequence lists squares occupied by the third player.

%H Rémy Sigrist, <a href="/A396118/b396118.txt">Table of n, a(n) for n = 1..10000</a>

%H Rémy Sigrist, <a href="/A396118/a396118.gp.txt">PARI program</a>

%o (PARI) \\ See Links section.

%Y Cf. A392177, A396116, A396117, A396119, A396120, A396121.

%K nonn

%O 1,1

%A _Rémy Sigrist_, May 20 2026