A335900 Squares visited by a fairy chess wazir moving on a square-spiral numbered board where the wazir moves to the unvisited square containing the spiral number with the fewest divisors. In case of a tie it chooses the square with the lowest spiral number.

1, 2, 3, 4, 5, 6, 7, 8, 23, 22, 21, 20, 19, 18, 17, 38, 37, 64, 65, 66, 67, 68, 39, 40, 41, 42, 43, 74, 73, 110, 109, 154, 155, 208, 269, 268, 337, 338, 339, 340, 271, 272, 211, 274, 275, 346, 347, 426, 427, 514, 515, 428, 349, 278, 277, 214, 159, 158, 157, 212, 213, 276

Offset

1,2

Comments

A fairy chess wazir can move one step in each of the four orthogonal grid directions, i.e., the same directions as a chess rook but only one square. In this sequence the wazir moves to the closest unvisited neighboring square which contains the number with the fewest divisors, and in case of a tie the square with the lowest spiral number. Note that if the wazir simply moves to the lowest available number the sequence will be infinite as the wazir will just follow the square spiral path.

The sequence is finite. After 61 steps the square with number 276 is visited, after which all four neighboring squares have been visited.

Due to the wazir's preference for squares with the fewest divisors it will move to a prime numbered square when possible, and the lowest prime if two or more unvisited primes are in neighboring squares. Of the 61 visited squares, 21 contain prime numbers, while 40 contain composites. The largest visited square is a(51) = 515.

Links

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

Scott R. Shannon, Image showing the 61 steps of the wazir's path. A green dot marks the starting 1 square and a red dot the final square with number 276. The red dot is surrounded by four blue dots to show the unavailable neighboring squares. A yellow dot marks the smallest unvisited square with number 9.

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(1) = 1, the starting square for the wazir.
a(2) = 2. The four unvisited squares around a(1) to which the wazir can move are numbered 2,4,6,8. Of these, 2 has only two divisors, so it is the square chosen.
a(9) = 23. The two unvisited squares around a(8) = 8 to which the wazir can move are numbered 9 and 23. Of these, 23 has only two divisors, so it is the square chosen.

Crossrefs

Cf. A335816, A333713, A333714, A336092, A336038, A316667.

Sequence in context: A053408 A269355 A269357 * A096986 A031097 A162234

Adjacent sequences: A335897 A335898 A335899 * A335901 A335902 A335903

Keyword

nonn,walk,fini,full

Author

Scott R. Shannon, Jun 29 2020

Status

approved