A316668 - OEIS

%I #7 Aug 18 2019 04:34:00

%S 1,2,3,5,4,7,8,9,6,10,14,13,12,11,16,17,18,19,20,15,21,27,26,25,24,23,

%T 22,29,30,31,32,33,34,35,28,36,44,43,42,41,40,39,38,37,46,47,48,49,50,

%U 51,52,53,54,45,55,65,64,63,62,61,60,59,58,57,56,67,68

%N Squares visited by king 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 king move instead of knight move.

%H Daniël Karssen, <a href="/A316668/b316668.txt">Table of n, a(n) for n = 1..100000</a>

%H Daniël Karssen, <a href="/A316668/a316668.svg">Figure showing the first 26 steps of the sequence</a>

%Y Cf. A316588, A316669, A316670, A316671.

%K nonn

%O 1,2

%A _Daniël Karssen_, Jul 15 2018