A317471 Squares visited by a (2,3)-leaper on a spirally numbered board and moving to the lowest available unvisited square at each step, squares labelled >=1.

1, 26, 3, 20, 15, 10, 5, 24, 19, 14, 7, 12, 23, 18, 9, 16, 11, 22, 39, 8, 13, 6, 25, 4, 21, 2, 17, 60, 29, 34, 93, 88, 27, 46, 41, 76, 71, 114, 47, 28, 33, 54, 59, 134, 31, 86, 49, 116, 43, 106, 37, 96, 187, 90, 137, 56, 95, 30, 61, 38, 97, 32, 53, 48, 85, 80, 125, 120, 173

Offset: 1

Author

Daniël Karssen, Jul 29 2018

Keywords

• nonn
• fini
• full

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 4634, square 4698 is visited, after which there are no unvisited squares within one move.

Links

• Daniël Karssen, Table of n, a(n) for n = 1..4634
• Daniël Karssen, Figure showing the complete sequence

Crossrefs

Cf. A317470, A317473.

Formula

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