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

0, 83, 30, 17, 26, 43, 14, 47, 40, 11, 36, 21, 32, 25, 18, 29, 46, 15, 42, 9, 38, 31, 22, 35, 28, 19, 48, 13, 44, 37, 10, 41, 34, 23, 68, 97, 186, 87, 60, 103, 192, 93, 52, 117, 172, 285, 162, 81, 176, 133, 248, 143, 202, 109, 344, 215, 70, 1, 66, 59, 6, 49, 12, 39

Offset

0,2

Comments

Board is numbered with the square spiral:

16--15--14--13--12

| |

17 4---3---2 11 .

| | | |

18 5 0---1 10 .

| | |

19 6---7---8---9 .

|

20--21--22--23--24--25

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

Links

Daniël Karssen, Table of n, a(n) for n = 0..7573

Daniël Karssen, Figure showing the first 35 steps of the sequence

Daniël Karssen, Figure showing the complete sequence

Formula

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

Crossrefs

Cf. A317916, A317917.

Sequence in context: A113890 A051327 A272637 * A033403 A174092 A346979

Adjacent sequences: A317912 A317913 A317914 * A317916 A317917 A317918

Keyword

nonn,fini,full

Author

Daniël Karssen, Aug 11 2018

Status

approved