A342946 - OEIS

%I #8 Apr 16 2021 00:11:48

%S 1,8,6,2,12,16,24,19,15,34,14,21,43,20,25,17,39,29,23,32,42,35,45,53,

%T 28,54,63,73,84,50,59,47,56,69,80,92,108,95,83,72,62,75,44,55,89,101,

%U 86,98,111,125,140,94,107,121,173,156,137,122,174,157,141,126

%N Squares visited by the white knight when a white knight and a black knight are moving on a diagonally numbered board, always to the lowest available unvisited square; white moves first.

%C Board is numbered as follows:

%C    1  2  4  7 11 16  .

%C    3  5  8 12 17  .

%C    6  9 13 18  .

%C   10 14 19  .

%C   15 20  .

%C   21  .

%C    .

%C Both knights start on square 1, white moves to the lowest unvisited square (8), black then moves to the lowest unvisited square (9) and so on...

%C This sequence is finite, on the white knight's 292nd step, square 406 is visited, after which there are no unvisited squares within one knight move.

%o (Python) # see program in A342948

%o A342946_lst = [1] + A342948_lst[1::2] # _Michael S. Branicky_, Mar 30 2021

%Y Cf. A338288, A338289, A338290, A342947, A342948.

%K nonn,fini

%O 1,2

%A _Andrew Smith_, Mar 30 2021