A329520
a(n) is the number of completed steps before being trapped for a knight moving on a square-spiral numbered board where the knight moves to an unvisited square with the lowest spiral number and with n or fewer visited neighbors. It only moves to squares with n+1 or more visited neighbors when no other squares are available, and if two or more such squares are present it chooses the square with the fewest visited neighbors, then the square with the lowest spiral number if still tied.
| n |
a(n) |
| 1 |
1151 |
| 2 |
225 |
| 3 |
1866 |
| 4 |
513316 |
| 5 |
11171 |
| 6 |
3935788 |
| 7 |
23014 |
| 8 |
2015 |
[1151, 225, 1866, 513316, 11171, 3935788, 23014, 2015]