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

1, 52, 23, 14, 25, 20, 11, 18, 13, 24, 15, 22, 17, 12, 19, 10, 21, 16, 29, 6, 27, 32, 9, 34, 7, 26, 45, 4, 47, 42, 67, 108, 149, 36, 41, 2, 39, 44, 5, 28, 57, 86, 3, 38, 33, 8, 35, 30, 51, 46, 71, 104, 143, 96, 65, 40, 63, 94, 131, 176, 123, 48, 75, 118, 161, 156, 107, 66

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

Links

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

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

Daniël Karssen, Figure showing the complete sequence

Formula

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

Crossrefs

Cf. A317415, A317418.

Sequence in context: A100990 A298573 A048365 * A033372 A126767 A143723

Adjacent sequences: A317413 A317414 A317415 * A317417 A317418 A317419

Keyword

nonn,fini,full

Author

Daniël Karssen, Jul 27 2018

Status

approved