cp's OEIS Frontend

A317437 Squares visited by a (1,5)-leaper on a spirally numbered board and moving to the lowest available unvisited square at each step, squares labelled >=0.

%I A317437 #12 Feb 06 2025 04:09:16
%S A317437 0,84,22,32,24,30,16,28,18,26,20,34,54,4,52,6,50,44,14,46,12,36,58,8,
%T A317437 60,88,124,178,230,48,74,38,10,40,62,92,140,186,238,176,122,86,80,114,
%U A317437 154,104,72,116,158,106,64,94,130,174,168,218,276,42,66,2,68,98,136
%N A317437 Squares visited by a (1,5)-leaper on a spirally numbered board and moving to the lowest available unvisited square at each step, squares labelled >=0.
%C A317437 Board is numbered with the square spiral:
%C A317437 .
%C A317437   16--15--14--13--12
%C A317437    |               |
%C A317437   17   4---3---2  11   .
%C A317437    |   |       |   |
%C A317437   18   5   0---1  10   .
%C A317437    |   |           |
%C A317437   19   6---7---8---9   .
%C A317437    |
%C A317437   20--21--22--23--24--25
%C A317437 .
%C A317437 The sequence is finite: at step 14569, square 25962 is visited, after which there are no unvisited squares within one move.
%H A317437 Daniël Karssen, <a href="/A317437/b317437.txt">Table of n, a(n) for n = 0..14569</a>
%H A317437 Daniël Karssen, <a href="/A317437/a317437.svg">Figure showing the first 26 steps of the sequence</a>
%H A317437 Daniël Karssen, <a href="/A317437/a317437_1.svg">Figure showing the complete sequence</a>
%F A317437 a(n) = A317438(n+1) - 1.
%Y A317437 Cf. A317438, A317439.
%K A317437 nonn,fini,full
%O A317437 0,2
%A A317437 _Daniël Karssen_, Jul 28 2018