%I
%S 1,84,31,18,27,44,15,48,41,12,37,22,33,26,19,30,47,16,43,10,39,32,23,
%T 36,29,20,49,14,45,38,11,42,35,24,69,98,187,88,61,104,193,94,53,118,
%U 173,286,163,82,177,134,249,144,203,110,345,216,71,2,67,60,7,50,13,40
%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 1716151413
%C  
%C 18 543 12 .
%C    
%C 19 6 12 11 .
%C   
%C 20 78910 .
%C 
%C 212223242526
%C The sequence is finite: at step 7574, square 6760 is visited, after which there are no unvisited squares within one move.
%H Daniël Karssen, <a href="/A317916/b317916.txt">Table of n, a(n) for n = 1..7574</a>
%H Daniël Karssen, <a href="/A317916/a317916.svg">Figure showing the first 35 steps of the sequence</a>
%H Daniël Karssen, <a href="/A317916/a317916_1.svg">Figure showing the complete sequence</a>
%F a(n) = A317915(n1) + 1.
%Y Cf. A317915, A317918.
%K nonn,fini,full
%O 1,2
%A _Daniël Karssen_, Aug 11 2018
