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.

A278167 a(n) = number of primes 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 1
3 2
4 2
5 2
6 3
7 5
8 6
9 7
10 7
11 9
12 10
13 12
14 12
15 15
16 17
17 17
18 20
19 20
20 22
21 22
22 23
23 27
24 29
25 32
26 34
27 38
28 40
29 40
30 43
31 46
32 48
33 53
34 56
35 60
36 63
37 66
38 69
39 71
40 75
41 77
42 79
43 83
44 86
45 89
46 92
47 98
48 101
49 102
50 105
51 109
52 111
53 117
54 120
55 123
56 125
57 130
58 135
59 140
60 145
61 149
62 152
63 159
64 163
65 167
66 173
67 177
68 179
69 183
70 189
71 194
72 199
73 204
74 208
75 215
76 219
77 223
78 230
79 234

List of values

[1, 1, 2, 2, 2, 3, 5, 6, 7, 7, 9, 10, 12, 12, 15, 17, 17, 20, 20, 22, 22, 23, 27, 29, 32, 34, 38, 40, 40, 43, 46, 48, 53, 56, 60, 63, 66, 69, 71, 75, 77, 79, 83, 86, 89, 92, 98, 101, 102, 105, 109, 111, 117, 120, 123, 125, 130, 135, 140, 145, 149, 152, 159, 163, 167, 173, 177, 179, 183, 189, 194, 199, 204, 208, 215, 219, 223, 230, 234]