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.

A338938 a(1)=0. For n >= 2, let S be the sum of all nonprime digits in a(1), a(2), ... a(n-1) and let P be the next prime not already in the sequence. If S is a nonprime number less than P and not already in the sequence, a(n) = S. Otherwise, a(n) = P.

Table of values

n a(n)
1 0
2 2
3 3
4 5
5 7
6 11
7 13
8 17
9 4
10 8
11 16
12 19
13 23
14 29
15 31
16 37
17 41
18 43
19 47
20 53
21 56
22 59
23 61
24 67
25 71
26 73
27 79
28 83
29 89
30 97
31 101
32 103
33 107
34 109
35 113
36 127
37 131
38 137
39 139
40 149
41 151
42 157
43 163
44 167
45 173
46 179
47 181
48 191
49 193
50 197
51 199
52 211
53 223
54 227
55 229
56 233
57 239
58 241
59 251
60 257

List of values

[0, 2, 3, 5, 7, 11, 13, 17, 4, 8, 16, 19, 23, 29, 31, 37, 41, 43, 47, 53, 56, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257]