|
%I #6 Aug 18 2019 04:32:17
%S 1,5,4,6,14,11,12,13,15,27,22,23,24,25,26,28,44,37,38,39,40,41,42,43,
%T 45,65,56,57,58,59,60,61,62,63,64,66,90,79,80,81,82,83,84,85,86,87,88,
%U 89,91,119,106,107,108,109,110,111,112,113,114,115,116,117
%N Squares visited by bishop moves on a diagonally numbered board and moving to the lowest available unvisited square at each step.
%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 Same as A316588 but with bishop move instead of knight move.
%H Daniël Karssen, <a href="/A316670/b316670.txt">Table of n, a(n) for n = 1..10000</a>
%H Daniël Karssen, <a href="/A316670/a316670.svg">Figure showing the first 10 steps of the sequence</a>
%Y Cf. A316588, A316668, A316669, A316671.
%K nonn
%O 1,2
%A _Daniël Karssen_, Jul 15 2018
|
