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

1, 85, 23, 33, 25, 31, 17, 29, 19, 27, 21, 35, 55, 5, 53, 7, 51, 45, 15, 47, 13, 37, 59, 9, 61, 89, 125, 179, 231, 49, 75, 39, 11, 41, 63, 93, 141, 187, 239, 177, 123, 87, 81, 115, 155, 105, 73, 117, 159, 107, 65, 95, 131, 175, 169, 219, 277, 43, 67, 3, 69, 99, 137

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

Links

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

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

Daniël Karssen, Figure showing the complete sequence

Crossrefs

Cf. A317437, A317440.

Sequence in context: A096132 A078083 A259915 * A105328 A033405 A295607

Adjacent sequences: A317435 A317436 A317437 * A317439 A317440 A317441

Keyword

nonn,fini,full,changed

Author

Daniël Karssen, Jul 28 2018

Status

approved