A343563 Squares visited by a knight moving on a square-spiral numbered board where the knight moves to the unvisited square containing the spiral number with the smallest digit sum. In case of a tie it chooses the lowest number.

1, 10, 3, 30, 11, 4, 13, 2, 5, 20, 23, 6, 21, 40, 105, 202, 103, 100, 141, 250, 315, 190, 251, 140, 61, 14, 31, 12, 15, 32, 55, 130, 91, 180, 301, 234, 127, 52, 25, 50, 121, 222, 119, 220, 117, 80, 51, 124, 231, 126, 53, 26, 9, 22, 41, 106, 203, 104, 201, 102, 143, 252, 321, 480, 323, 400, 403

Offset

1,2

Comments

This sequences gives the numbers of the squares visited by a knight moving on a square-spiral numbered board where at each step the knight moves to the unvisited neighbor one knight-leap away which contains the number with the smallest digit sum. If two or more neighbors exist with the same digit sum then from those squares the one with the lowest number is chosen.

The sequence is finite. After 790 steps the square with number 69 is visited, after which all eight neighboring squares have been visited. The largest visit spiral number is a(626) = 6112, while there are four squares with the largest visited digit sum of 19: a(373) = 2683, a(539) = 2737, a(590) = 2944, a(594) = 2728.

Links

Table of n, a(n) for n=1..67.

Scott R. Shannon, Image showing the 791 visited squares. The starting square is highlighted in white, the visited squares in yellow, the final square in red, while the path is colored across the spectrum to show the relative step ordering.

N. J. A. Sloane and Brady Haran, The Trapped Knight, Numberphile video (2019).

Example

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(2) = 10 as the eight unvisited neighbors of the square a(1) = 1 are numbered 10,12,14,16,18,20,22,24, and 10, with a digit sum of 1, has the lowest digit sum of these.
a(4) = 30 as the seven unvisited neighbors of the square a(3) = 3 square are numbered 6,8,28,30,32,34,16, and 30, with a digit sum of 3, has the lowest digit sum of these.
a(9) = 5 as two of the unvisited neighbors of the square a(8) = 2 are 5 and 23, both of which have a digit sum of 5, but 5 is chosen as it is the lower number.

Crossrefs

Cf. A007953, A316667, A328894, A326922, A328928.

Sequence in context: A228314 A243239 A079670 * A050100 A103219 A260680

Adjacent sequences: A343560 A343561 A343562 * A343564 A343565 A343566

Keyword

nonn,base,fini

Author

Scott R. Shannon, Apr 19 2021

Status

approved