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.

A343388 Squares visited by a knight moving on a square-spiral with numbers equal to the ordered divisors of the positive integers and 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 ordered spiral number is used if the distances are equal.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 4, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 1, 2, 1, 5, 1, 1, 3, 1, 4, 1, 1, 8, 1, 3, 2, 2, 3, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1]