|
%I #8 Jul 31 2018 10:08:56
%S 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 16,59,28,33,92,87,26,45,40,75,70,113,46,27,32,53,58,133,30,85,48,115,
%U 42,105,36,95,186,89,136,55,94,29,60,37,96,31,52,47,84,79,124,119,172
%N Squares visited by a (2,3)-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 4633, square 4697 is visited, after which there are no unvisited squares within one move.
%H Daniël Karssen, <a href="/A317470/b317470.txt">Table of n, a(n) for n = 0..4633</a>
%H Daniël Karssen, <a href="/A317470/a317470.svg">Figure showing the first 51 steps of the sequence</a>
%H Daniël Karssen, <a href="/A317470/a317470_1.svg">Figure showing the complete sequence</a>
%F a(n) = A317471(n+1) - 1.
%Y Cf. A317471, A317472.
%K nonn,fini,full
%O 0,2
%A _Daniël Karssen_, Jul 29 2018
|
