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.

A323811 Squares visited by a knight on a diagonally numbered board and moving to the lowest available unvisited square at each step and if no unvisited squares are available move one step back.

Table of values

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

List of values

[0, 7, 5, 1, 11, 8, 3, 2, 12, 6, 4, 9, 25, 17, 10, 29, 23, 15, 37, 30, 21, 16, 24, 19, 27, 33, 13, 20, 42, 32, 26, 18, 14, 34, 41, 31, 22, 28, 38, 46, 55, 68, 36, 47, 39, 50, 59, 69, 56, 66, 80, 45, 57, 48, 40, 51, 43, 54, 63, 35, 64, 52, 44, 75, 62, 53, 65, 102, 87, 73, 60]