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.

A329519 Squares visited by a knight moving on a square-spiral numbered board where the knight moves to an unvisited square with the lowest spiral number and with six or fewer visited neighbors. It only moves to squares with seven or more visited neighbors when no other square is available; if two or more such squares are present it chooses the square with the fewest neighbors, then the square with the lowest spiral number if still tied.

Table of values

n a(n)
1 1
2 10
3 3
4 6
5 9
6 4
7 7
8 2
9 5
10 8
11 11
12 14
13 29
14 32
15 15
16 12
17 27
18 24
19 45
20 20
21 23
22 44
23 41
24 18
25 35
26 38
27 19
28 16
29 33
30 30
31 53
32 26
33 47
34 22
35 43
36 70
37 21
38 40
39 17
40 34
41 13
42 28
43 25
44 46
45 75
46 42
47 69
48 104
49 37
50 62
51 95
52 58
53 55
54 86
55 51
56 48
57 77
58 114
59 73
60 108
61 151
62 68
63 103
64 64
65 67
66 36

List of values

[1, 10, 3, 6, 9, 4, 7, 2, 5, 8, 11, 14, 29, 32, 15, 12, 27, 24, 45, 20, 23, 44, 41, 18, 35, 38, 19, 16, 33, 30, 53, 26, 47, 22, 43, 70, 21, 40, 17, 34, 13, 28, 25, 46, 75, 42, 69, 104, 37, 62, 95, 58, 55, 86, 51, 48, 77, 114, 73, 108, 151, 68, 103, 64, 67, 36]