login
A317106
Squares visited by a (1,3)-leaper on a spirally numbered board and moving to the lowest available unvisited square at each step.
14
1, 27, 13, 5, 11, 7, 15, 9, 19, 3, 17, 33, 55, 85, 25, 29, 51, 47, 21, 39, 63, 95, 57, 87, 125, 49, 23, 41, 67, 35, 59, 89, 53, 31, 61, 37, 69, 43, 77, 113, 71, 45, 73, 107, 149, 101, 141, 189, 135, 181, 129, 91, 137, 97, 65, 105, 147, 99, 139, 93, 131, 177, 231
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 3723, square 7081 is visited, after which there are no unvisited squares within one move.
FORMULA
a(n) = A317105(n-1) + 1.
CROSSREFS
Sequence in context: A103948 A323835 A040705 * A033347 A173896 A271450
KEYWORD
nonn,fini,full
AUTHOR
Daniël Karssen, Jul 24 2018
STATUS
approved