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

0, 84, 22, 32, 24, 30, 16, 28, 18, 26, 20, 34, 54, 4, 52, 6, 50, 44, 14, 46, 12, 36, 58, 8, 60, 88, 124, 178, 230, 48, 74, 38, 10, 40, 62, 92, 140, 186, 238, 176, 122, 86, 80, 114, 154, 104, 72, 116, 158, 106, 64, 94, 130, 174, 168, 218, 276, 42, 66, 2, 68, 98, 136

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

Links

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

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

Daniël Karssen, Figure showing the complete sequence

Formula

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

Crossrefs

Cf. A317438, A317439.

Sequence in context: A093676 A221416 A130432 * A304379 A317916 A066689

Adjacent sequences: A317434 A317435 A317436 * A317438 A317439 A317440

Keyword

nonn,fini,full

Author

Daniël Karssen, Jul 28 2018

Status

approved