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.

A341672 a(n) is the number of numbers on the square spiral board such that it takes n steps for them to reach square 1 along the shortest path without stepping on any prime number.

Table of values

n a(n)
0 1
1 4
2 7
3 5
4 9
5 8
6 12
7 10
8 14
9 23
10 29
11 32
12 35
13 38
14 46
15 47
16 52
17 59
18 65
19 64
20 67
21 76
22 78
23 84
24 90
25 91
26 94
27 100
28 106
29 110
30 111
31 110
32 119
33 126
34 131
35 137
36 139
37 138
38 143
39 153
40 154
41 144
42 152
43 144
44 152
45 156
46 170
47 195
48 193
49 193
50 192
51 198
52 203
53 215
54 215
55 209
56 216
57 222
58 225

List of values

[1, 4, 7, 5, 9, 8, 12, 10, 14, 23, 29, 32, 35, 38, 46, 47, 52, 59, 65, 64, 67, 76, 78, 84, 90, 91, 94, 100, 106, 110, 111, 110, 119, 126, 131, 137, 139, 138, 143, 153, 154, 144, 152, 144, 152, 156, 170, 195, 193, 193, 192, 198, 203, 215, 215, 209, 216, 222, 225]