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

0, 25, 2, 19, 14, 9, 4, 23, 18, 13, 6, 11, 22, 17, 8, 15, 10, 21, 38, 7, 12, 5, 24, 3, 20, 1, 16, 59, 28, 33, 92, 87, 26, 45, 40, 75, 70, 113, 46, 27, 32, 53, 58, 133, 30, 85, 48, 115, 42, 105, 36, 95, 186, 89, 136, 55, 94, 29, 60, 37, 96, 31, 52, 47, 84, 79, 124, 119, 172

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

Links

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

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

Daniël Karssen, Figure showing the complete sequence

Formula

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

Crossrefs

Cf. A317471, A317472.

Sequence in context: A006852 A040622 A040623 * A094582 A040624 A040613

Adjacent sequences: A317467 A317468 A317469 * A317471 A317472 A317473

Keyword

nonn,fini,full

Author

Daniël Karssen, Jul 29 2018

Status

approved