A396172 - OEIS

A396172

Consider the square spiral with its cells numbered starting at 0. Seven 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 sixth player.

%I #5 May 23 2026 10:43:53

%S 25,41,46,70,72,79,106,108,115,117,149,160,162,200,204,219,254,262,

%T 264,281,299,328,334,348,350,369,387,406,412,431,439,451,480,492,500,

%U 512,527,541,561,580,586,594,608,623,637,657,682,688,698,710,723,733,747

%N Consider the square spiral with its cells numbered starting at 0. Seven 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 sixth player.

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

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

%o (PARI) \\ See Links section.

%Y Cf. A392177, A396167, A396168, A396169, A396170, A396171, A396173, A396174, A396175.

%K nonn

%O 1,1

%A _Rémy Sigrist_, May 23 2026