cp's OEIS Frontend

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

%I A317471 #9 Feb 06 2025 04:18:46
%S A317471 1,26,3,20,15,10,5,24,19,14,7,12,23,18,9,16,11,22,39,8,13,6,25,4,21,2,
%T A317471 17,60,29,34,93,88,27,46,41,76,71,114,47,28,33,54,59,134,31,86,49,116,
%U A317471 43,106,37,96,187,90,137,56,95,30,61,38,97,32,53,48,85,80,125,120,173
%N A317471 Squares visited by a (2,3)-leaper on a spirally numbered board and moving to the lowest available unvisited square at each step, squares labelled >=1.
%C A317471 Board is numbered with the square spiral:
%C A317471 .
%C A317471   17--16--15--14--13
%C A317471    |               |
%C A317471   18   5---4---3  12   .
%C A317471    |   |       |   |
%C A317471   19   6   1---2  11   .
%C A317471    |   |           |
%C A317471   20   7---8---9--10   .
%C A317471    |
%C A317471   21--22--23--24--25--26
%C A317471 .
%C A317471 The sequence is finite: at step 4634, square 4698 is visited, after which there are no unvisited squares within one move.
%H A317471 Daniël Karssen, <a href="/A317471/b317471.txt">Table of n, a(n) for n = 1..4634</a>
%H A317471 Daniël Karssen, <a href="/A317471/a317471.svg">Figure showing the complete sequence</a>
%F A317471 a(n) = A317470(n-1) + 1.
%Y A317471 Cf. A317470, A317473.
%K A317471 nonn,fini,full
%O A317471 1,2
%A A317471 _Daniël Karssen_, Jul 29 2018