The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #10 Apr 16 2021 00:12:00
%S 1,9,4,3,13,7,5,10,26,18,11,30,37,48,22,31,38,46,58,49,41,52,27,33,40,
%T 51,60,70,57,67,81,93,106,123,79,68,82,71,61,74,64,36,65,78,118,77,88,
%U 100,85,97,110,124,139,155,172,193,138,154,212,232,256,191,213
%N Squares visited by the black 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 black knight's 5503rd step, square 3828 is visited, after which there are no unvisited squares within one knight move.
%o (Python) # see program in A342948
%o A342947_lst = A342948_lst[::2] # _Michael S. Branicky_, Mar 30 2021
%Y Cf. A338288, A338289, A338290, A342946, A342948.
%K nonn,fini
%O 1,2
%A _Andrew Smith_, Mar 30 2021