Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Aug 14 2018 09:03:58
%S 0,84,22,32,24,30,16,28,18,26,20,34,54,4,52,6,50,44,14,46,12,36,58,8,
%T 60,88,124,178,230,48,74,38,10,40,62,92,140,186,238,176,122,86,80,114,
%U 154,104,72,116,158,106,64,94,130,174,168,218,276,42,66,2,68,98,136
%N Squares visited by a (1,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 .
%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 .
%C The sequence is finite: at step 14569, square 25962 is visited, after which there are no unvisited squares within one move.
%H Daniël Karssen, <a href="/A317437/b317437.txt">Table of n, a(n) for n = 0..14569</a>
%H Daniël Karssen, <a href="/A317437/a317437.svg">Figure showing the first 26 steps of the sequence</a>
%H Daniël Karssen, <a href="/A317437/a317437_1.svg">Figure showing the complete sequence</a>
%F a(n) = A317438(n+1) - 1.
%Y Cf. A317438, A317439.
%K nonn,fini,full
%O 0,2
%A _Daniël Karssen_, Jul 28 2018