%I #6 Sep 17 2018 21:10:47

%S 0,83,30,17,26,43,14,47,40,11,36,21,32,25,18,29,46,15,42,9,38,31,22,

%T 35,28,19,48,13,44,37,10,41,34,23,68,97,186,87,60,103,192,93,52,117,

%U 172,285,162,81,176,133,248,143,202,109,344,215,70,1,66,59,6,49,12,39

%N Squares visited by a (2,5)-leaper on a spirally numbered board and moving to the lowest available unvisited square at each step.

%C Board is numbered with the square spiral:

%C 16--15--14--13--12

%C | |

%C 17 4---3---2 11 .

%C | | | |

%C 18 5 0---1 10 .

%C | | |

%C 19 6---7---8---9 .

%C |

%C 20--21--22--23--24--25

%C The sequence is finite: at step 7573, square 6759 is visited, after which there are no unvisited squares within one move.

%H Daniël Karssen, <a href="/A317915/b317915.txt">Table of n, a(n) for n = 0..7573</a>

%H Daniël Karssen, <a href="/A317915/a317915.svg">Figure showing the first 35 steps of the sequence</a>

%H Daniël Karssen, <a href="/A317915/a317915_1.svg">Figure showing the complete sequence</a>

%F a(n) = A317916(n+1) - 1.

%Y Cf. A317916, A317917.

%K nonn,fini,full

%O 0,2

%A _Daniël Karssen_, Aug 11 2018