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

1, 84, 31, 18, 27, 44, 15, 48, 41, 12, 37, 22, 33, 26, 19, 30, 47, 16, 43, 10, 39, 32, 23, 36, 29, 20, 49, 14, 45, 38, 11, 42, 35, 24, 69, 98, 187, 88, 61, 104, 193, 94, 53, 118, 173, 286, 163, 82, 177, 134, 249, 144, 203, 110, 345, 216, 71, 2, 67, 60, 7, 50, 13, 40

Offset

1,2

Comments

Board is numbered with the square spiral:

17--16--15--14--13

| |

18 5---4---3 12 .

| | | |

19 6 1---2 11 .

| | |

20 7---8---9--10 .

|

21--22--23--24--25--26

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

Links

Daniël Karssen, Table of n, a(n) for n = 1..7574

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

Daniël Karssen, Figure showing the complete sequence

Formula

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

Crossrefs

Cf. A317915, A317918.

Sequence in context: A130432 A317437 A304379 * A066689 A008898 A033404

Adjacent sequences: A317913 A317914 A317915 * A317917 A317918 A317919

Keyword

nonn,fini,full

Author

Daniël Karssen, Aug 11 2018

Status

approved