Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
A317415
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 >=0.
10
0, 51, 22, 13, 24, 19, 10, 17, 12, 23, 14, 21, 16, 11, 18, 9, 20, 15, 28, 5, 26, 31, 8, 33, 6, 25, 44, 3, 46, 41, 66, 107, 148, 35, 40, 1, 38, 43, 4, 27, 56, 85, 2, 37, 32, 7, 34, 29, 50, 45, 70, 103, 142, 95, 64, 39, 62, 93, 130, 175, 122, 47, 74, 117, 160, 155, 106, 65
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 13102, square 10846 is visited, after which there are no unvisited squares within one move.
FORMULA
a(n) = A317416(n+1) - 1.
CROSSREFS
Sequence in context: A255852 A160474 A317620 * A033371 A191514 A334339
KEYWORD
nonn,fini,full
AUTHOR
Daniël Karssen, Jul 27 2018
STATUS
approved