A317437 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 >=0.
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
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.
Comments