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.

A362027 Squares visited by a knight moving on a square-spiral numbered board where the knight moves to a previously unvisited square with a number as close as possible to the number of the current square. If two such squares exist the smaller numbered square is chosen.

Table of values

n a(n)
1 1
2 10
3 3
4 6
5 9
6 12
7 15
8 18
9 7
10 4
11 11
12 8
13 5
14 2
15 13
16 28
17 25
18 46
19 21
20 40
21 17
22 34
23 59
24 56
25 29
26 32
27 55
28 58
29 33
30 30
31 53
32 26
33 47
34 22
35 19
36 16
37 37
38 62
39 95
40 136
41 91
42 130
43 87
44 52
45 49
46 24
47 27
48 48
49 51
50 80
51 83
52 120
53 123
54 84
55 81
56 118
57 77
58 44
59 41
60 68
61 103
62 100
63 63
64 66
65 39
66 36
67 61
68 94
69 57
70 88
71 127
72 174
73 229
74 170

List of values

[1, 10, 3, 6, 9, 12, 15, 18, 7, 4, 11, 8, 5, 2, 13, 28, 25, 46, 21, 40, 17, 34, 59, 56, 29, 32, 55, 58, 33, 30, 53, 26, 47, 22, 19, 16, 37, 62, 95, 136, 91, 130, 87, 52, 49, 24, 27, 48, 51, 80, 83, 120, 123, 84, 81, 118, 77, 44, 41, 68, 103, 100, 63, 66, 39, 36, 61, 94, 57, 88, 127, 174, 229, 170]