A316669 - OEIS

A316669

Squares visited by queen moves on a diagonally numbered board and moving to the lowest available unvisited square at each step.

%I #7 Aug 18 2019 04:33:13

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

%T 26,28,35,29,30,31,32,33,34,36,44,37,38,39,40,41,42,43,45,54,46,47,48,

%U 49,50,51,52,53,55,65,56,57,58,59,60,61,62,63,64,66,77

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

%H Daniël Karssen, <a href="/A316669/b316669.txt">Table of n, a(n) for n = 1..10000</a>

%H Daniël Karssen, <a href="/A316669/a316669.svg">Figure showing the first 22 steps of the sequence</a>

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

%K nonn

%O 1,2

%A _Daniël Karssen_, Jul 15 2018