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.
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
Links
- Daniël Karssen, Table of n, a(n) for n = 0..13102
- Daniël Karssen, Figure showing the first 58 steps of the sequence
- Daniël Karssen, Figure showing the complete sequence
Formula
a(n) = A317416(n+1) - 1.
Comments