cp's OEIS Frontend

A317470 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 >=0.

%I A317470 #10 Feb 06 2025 04:15:30
%S A317470 0,25,2,19,14,9,4,23,18,13,6,11,22,17,8,15,10,21,38,7,12,5,24,3,20,1,
%T A317470 16,59,28,33,92,87,26,45,40,75,70,113,46,27,32,53,58,133,30,85,48,115,
%U A317470 42,105,36,95,186,89,136,55,94,29,60,37,96,31,52,47,84,79,124,119,172
%N A317470 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 >=0.
%C A317470 Board is numbered with the square spiral:
%C A317470 .
%C A317470   16--15--14--13--12
%C A317470    |               |
%C A317470   17   4---3---2  11   .
%C A317470    |   |       |   |
%C A317470   18   5   0---1  10   .
%C A317470    |   |           |
%C A317470   19   6---7---8---9   .
%C A317470    |
%C A317470   20--21--22--23--24--25
%C A317470 .
%C A317470 The sequence is finite: at step 4633, square 4697 is visited, after which there are no unvisited squares within one move.
%H A317470 Daniël Karssen, <a href="/A317470/b317470.txt">Table of n, a(n) for n = 0..4633</a>
%H A317470 Daniël Karssen, <a href="/A317470/a317470.svg">Figure showing the first 51 steps of the sequence</a>
%H A317470 Daniël Karssen, <a href="/A317470/a317470_1.svg">Figure showing the complete sequence</a>
%F A317470 a(n) = A317471(n+1) - 1.
%Y A317470 Cf. A317471, A317472.
%K A317470 nonn,fini,full
%O A317470 0,2
%A A317470 _Daniël Karssen_, Jul 29 2018