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.

A329129 Squares visited by a knight moving on a board with squares numbered with the minimum number of steps for a knight to reach the square when starting from the origin. The knight moves to the smallest numbered unvisited square; the minimum distance from the origin is used if the square numbers are equal; the smallest spiral number ordering is used if the distances are equal.

Table of values

n a(n)
0 0
1 1
2 2
3 1
4 2
5 1
6 2
7 1
8 2
9 1
10 2
11 1
12 2
13 1
14 2
15 1
16 2
17 3
18 2
19 3
20 2
21 3
22 2
23 3
24 2
25 3
26 2
27 3
28 2
29 3
30 2
31 3
32 2
33 3
34 2
35 3
36 2
37 3
38 2
39 3
40 2
41 3
42 2
43 3
44 2
45 3
46 2
47 3
48 4
49 3
50 2
51 3
52 4
53 3
54 2
55 3
56 4
57 3
58 2
59 3
60 4
61 3
62 2
63 3
64 4
65 3
66 2
67 3
68 4
69 3
70 4
71 3
72 2
73 3
74 4
75 3
76 2
77 3
78 4
79 3
80 4
81 3
82 4
83 3
84 4
85 3
86 2
87 3
88 4
89 3
90 2
91 3
92 4
93 3
94 4
95 3
96 4

List of values

[0, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 4, 3, 2, 3, 4, 3, 2, 3, 4, 3, 2, 3, 4, 3, 2, 3, 4, 3, 2, 3, 4, 3, 4, 3, 2, 3, 4, 3, 2, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 3, 4, 3, 2, 3, 4, 3, 4, 3, 4]