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.

A278168 a(n) = number of integers one less 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 0
2 1
3 1
4 3
5 4
6 5
7 5
8 8
9 10
10 13
11 15
12 16
13 17
14 19
15 20
16 23
17 25
18 28
19 29
20 31
21 35
22 39
23 40
24 42
25 45
26 47
27 49
28 52
29 56
30 59
31 62
32 66
33 69
34 73
35 76
36 78
37 82
38 87
39 92
40 96
41 100
42 103
43 107
44 112
45 116
46 120
47 123
48 127
49 133
50 137
51 143
52 151
53 155
54 159
55 162
56 167
57 174
58 177
59 184
60 186
61 192
62 198
63 202
64 209
65 216
66 220
67 225
68 232
69 236
70 244
71 250
72 254
73 258
74 261
75 267
76 278
77 282
78 287
79 292
80 301

List of values

[0, 1, 1, 3, 4, 5, 5, 8, 10, 13, 15, 16, 17, 19, 20, 23, 25, 28, 29, 31, 35, 39, 40, 42, 45, 47, 49, 52, 56, 59, 62, 66, 69, 73, 76, 78, 82, 87, 92, 96, 100, 103, 107, 112, 116, 120, 123, 127, 133, 137, 143, 151, 155, 159, 162, 167, 174, 177, 184, 186, 192, 198, 202, 209, 216, 220, 225, 232, 236, 244, 250, 254, 258, 261, 267, 278, 282, 287, 292, 301]