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.
%I A333713 #48 Jul 10 2020 03:39:10 %S A333713 1,6,18,40,70,108,72,42,20,21,44,45,75,114,160,216,280,350,351,352, %T A333713 432,520,616,720,832,952,1080,1216,1360,1512,1672,1840,2016,2200,2392, %U A333713 2592,2800,3016,3240,3472,3710,3956,4212,4476,4746,5024,5310,5022,4743,4472,4473,4209,4208,3952,3705 %N A333713 Squares visited by a chess king moving on a square-spiral numbered board where the king moves to the adjacent unvisited square containing the spiral number with the most divisors. In case of a tie it chooses the square with the lowest spiral number. %C A333713 This sequences gives the numbers of the squares visited by a chess king moving on a square-spiral numbered board where the king starts on the 1 numbered square and at each step moves to an adjacent unvisited square, out of the eight adjacent neighboring squares, which contains the number with the most divisors. If two or more adjacent squares exist with the same highest number of divisors then the square with the lowest spiral number is chosen. Note that if the king simply moves to the highest available number the sequence will be infinite as the king will step along the south-east diagonal from square 1 forever. %C A333713 The sequence is finite. After 1784 steps the square with number 1478 is visited, after which all adjacent neighboring squares have been visited. %C A333713 Due to the king's preference for squares with the most divisors it will avoid prime numbers unless no other choice exists. Of the 1784 visited squares only 27 contain prime numbers while 1757 contain composites. As even numbers >= 6 will always contain 4 or more divisors the king will tend to visit more even numbers than odd numbers; in the 1784 visited squares 1289 contain an even number while 495 contain an odd number. As the even numbers are diagonally adjacent in the square spiral the king's path will be dominated by diagonal steps, often taking numerous diagonal steps is succession - see the attached link image. %C A333713 The largest visited square is a(390) = 17664. The lowest unvisited square is 2. %H A333713 Scott R. Shannon, <a href="/A333713/b333713.txt">Table of n, a(n) for n = 1..1785</a> %H A333713 Scott R. Shannon, <a href="/A333713/a333713.png">Image showing the 1784 steps of the king's path</a>. A green dot marks the starting 1 square and a red dot the final square with number 1478. The red dot is surrounded by eight blue dots to show the occupied neighboring squares. A yellow dots marks the smallest unvisited square with number 2. %e A333713 The board is numbered with the square spiral: %e A333713 . %e A333713 17--16--15--14--13 . %e A333713 | | . %e A333713 18 5---4---3 12 29 %e A333713 | | | | | %e A333713 19 6 1---2 11 28 %e A333713 | | | | %e A333713 20 7---8---9--10 27 %e A333713 | | %e A333713 21--22--23--24--25--26 %e A333713 . %e A333713 a(1) = 1, the starting square for the king. %e A333713 a(2) = 6. The eight unvisited squares around a(1) the king can move to are numbered 2,3,4,5,6,7,8,9. Of these 6 and 8 both have the maximum four divisors, and of those 6 is the smallest. %e A333713 a(3) = 18. The seven unvisited squares around a(2) = 6 the king can move to are numbered 4,5,18,19,20,7,8. Of these 18 and 20 have the maximum six divisors, and of those 18 is the smallest. %e A333713 a(603) = 821. This is the first prime number visited; a(602) = 939 has square 821 as the sole unvisited adjacent neighbor. %Y A333713 Cf. A333714 (choose highest spiral number in case of tie), A335816, A316667, A330008, A329520, A326922, A328928, A328929. %K A333713 nonn,walk,fini,full %O A333713 1,2 %A A333713 _Scott R. Shannon_, Jul 02 2020