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.

A278166 a(n) = number of integers one more than a prime encountered before reaching 0 when starting from k = ((n+1)^2)-1 and iterating map k -> k - A002828(k).

Table of values

n a(n)
1 1
2 3
3 3
4 5
5 7
6 9
7 9
8 11
9 12
10 14
11 15
12 18
13 19
14 22
15 23
16 26
17 29
18 31
19 34
20 37
21 42
22 46
23 47
24 51
25 54
26 58
27 60
28 64
29 68
30 70
31 74
32 78
33 82
34 85
35 88
36 92
37 95
38 99
39 104
40 109
41 114
42 118
43 122
44 128
45 134
46 137
47 140
48 149
49 153
50 158
51 164
52 173
53 177
54 183
55 187
56 191
57 199
58 205
59 210
60 217
61 222
62 231
63 236
64 241
65 248
66 256
67 262
68 273
69 278
70 287
71 291
72 298
73 307
74 316
75 322
76 332

List of values

[1, 3, 3, 5, 7, 9, 9, 11, 12, 14, 15, 18, 19, 22, 23, 26, 29, 31, 34, 37, 42, 46, 47, 51, 54, 58, 60, 64, 68, 70, 74, 78, 82, 85, 88, 92, 95, 99, 104, 109, 114, 118, 122, 128, 134, 137, 140, 149, 153, 158, 164, 173, 177, 183, 187, 191, 199, 205, 210, 217, 222, 231, 236, 241, 248, 256, 262, 273, 278, 287, 291, 298, 307, 316, 322, 332]