cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A358150 Squares visited by a knight moving on a square-spiral numbered board where the knight moves to the smallest numbered unvisited square and where the square number is more than the number of currently visited squares.

Original entry on oeis.org

1, 10, 3, 6, 9, 12, 15, 18, 35, 14, 11, 24, 27, 48, 23, 20, 39, 36, 61, 32, 29, 52, 25, 28, 51, 80, 47, 76, 43, 70, 105, 38, 63, 34, 59, 56, 87, 126, 53, 84, 49, 78, 45, 74, 71, 106, 67, 64, 97, 60, 93, 90, 55, 58, 89, 92, 131, 88, 127, 174, 83, 120, 79, 116, 75, 72, 107, 68, 103, 100, 141
Offset: 1

Views

Author

Scott R. Shannon, Nov 01 2022

Keywords

Comments

This sequence is finite: after 15767 squares have been visited the square with number 15813 is reached after which all eight neighboring squares the knight could move to have already been visited. See the linked image. The largest visited square is a(15525) = 19363, while numerous smaller numbered squares are never visited, e.g., 2, 4, 5, 7, 8, 13, 16, 17, 19, ... .

Examples

			The board is numbered with the square spiral:
.
  17--16--15--14--13   .
   |               |   .
  18   5---4---3  12   29
   |   |       |   |   |
  19   6   1---2  11   28
   |   |           |   |
  20   7---8---9--10   27
   |                   |
  21--22--23--24--25--26
.
a(6) = 12 as after the knight moves to the square containing 9 the available unvisited squares are 4, 12, 22, 26, 28, 46, 48. Of these 4 is the smallest but as we have already visited five squares that cannot be chosen. Of the remaining squares greater than five the smallest unvisited square is 12. This is the first term to differ from A316667.
		

Crossrefs