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.

A326918 Squares visited by a knight moving on a single-digit square-spiral numbered board where 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 0
2 1
3 0
4 1
5 0
6 1
7 1
8 2
9 2
10 1
11 1
12 0
13 1
14 1
15 1
16 1
17 1
18 1
19 1
20 0
21 1
22 1
23 1
24 1
25 1
26 2
27 1
28 1
29 0
30 1
31 1
32 1
33 1
34 1
35 1
36 0
37 1
38 1
39 1
40 0
41 2
42 2
43 1
44 1
45 0
46 2
47 3
48 2
49 2
50 1
51 3
52 1
53 1
54 1
55 2
56 2
57 3
58 2
59 3
60 1
61 4
62 3
63 5
64 6
65 1
66 1
67 1
68 1
69 1
70 3
71 1
72 1
73 1
74 3
75 1
76 1
77 0
78 1
79 1
80 1
81 1
82 1
83 1
84 1
85 1
86 2
87 0
88 0
89 1
90 1
91 0
92 0
93 1
94 0
95 1
96 1
97 1
98 0
99 1
100 0
101 1
102 0
103 1
104 0
105 2
106 0
107 1
108 1
109 0
110 1

List of values

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