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.

A343563 Squares visited by a knight moving on a square-spiral numbered board where the knight moves to the unvisited square containing the spiral number with the smallest digit sum. In case of a tie it chooses the lowest number.

Table of values

n a(n)
1 1
2 10
3 3
4 30
5 11
6 4
7 13
8 2
9 5
10 20
11 23
12 6
13 21
14 40
15 105
16 202
17 103
18 100
19 141
20 250
21 315
22 190
23 251
24 140
25 61
26 14
27 31
28 12
29 15
30 32
31 55
32 130
33 91
34 180
35 301
36 234
37 127
38 52
39 25
40 50
41 121
42 222
43 119
44 220
45 117
46 80
47 51
48 124
49 231
50 126
51 53
52 26
53 9
54 22
55 41
56 106
57 203
58 104
59 201
60 102
61 143
62 252
63 321
64 480
65 323
66 400
67 403

List of values

[1, 10, 3, 30, 11, 4, 13, 2, 5, 20, 23, 6, 21, 40, 105, 202, 103, 100, 141, 250, 315, 190, 251, 140, 61, 14, 31, 12, 15, 32, 55, 130, 91, 180, 301, 234, 127, 52, 25, 50, 121, 222, 119, 220, 117, 80, 51, 124, 231, 126, 53, 26, 9, 22, 41, 106, 203, 104, 201, 102, 143, 252, 321, 480, 323, 400, 403]