%I #11 Feb 06 2025 04:08:55
%S 1,85,23,33,25,31,17,29,19,27,21,35,55,5,53,7,51,45,15,47,13,37,59,9,
%T 61,89,125,179,231,49,75,39,11,41,63,93,141,187,239,177,123,87,81,115,
%U 155,105,73,117,159,107,65,95,131,175,169,219,277,43,67,3,69,99,137
%N 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 >=1.
%C Board is numbered with the square spiral:
%C .
%C 17--16--15--14--13
%C | |
%C 18 5---4---3 12 .
%C | | | |
%C 19 6 1---2 11 .
%C | | |
%C 20 7---8---9--10 .
%C |
%C 21--22--23--24--25--26
%C .
%C The sequence is finite: at step 14570, square 25963 is visited, after which there are no unvisited squares within one move.
%H Daniël Karssen, <a href="/A317438/b317438.txt">Table of n, a(n) for n = 1..14570</a>
%H Daniël Karssen, <a href="/A317438/a317438.svg">Figure showing the first 26 steps of the sequence</a>
%H Daniël Karssen, <a href="/A317438/a317438_1.svg">Figure showing the complete sequence</a>
%Y Cf. A317437, A317440.
%K nonn,fini,full,changed
%O 1,2
%A _Daniël Karssen_, Jul 28 2018