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.

A373805 If a(n-1) is not a prime, then a(n) = 2*a(n-1) + S; otherwise set S = -S and a(n) = prime(n) + S; start with a(1) = S = 1.

Table of values

n a(n)
1 1
2 3
3 4
4 7
5 12
6 25
7 51
8 103
9 22
10 43
11 32
12 65
13 131
14 42
15 83
16 54
17 109
18 60
19 119
20 237
21 473
22 945
23 1889
24 90
25 181
26 100
27 199
28 108
29 217
30 435
31 871
32 1743
33 3487
34 6975
35 13951
36 27903
37 55807
38 162
39 323
40 645
41 1289
42 182
43 365
44 731
45 1463
46 2927
47 210
48 419
49 228
50 457
51 232
52 463
53 242
54 485
55 971
56 262
57 523
58 272
59 545
60 1091

List of values

[1, 3, 4, 7, 12, 25, 51, 103, 22, 43, 32, 65, 131, 42, 83, 54, 109, 60, 119, 237, 473, 945, 1889, 90, 181, 100, 199, 108, 217, 435, 871, 1743, 3487, 6975, 13951, 27903, 55807, 162, 323, 645, 1289, 182, 365, 731, 1463, 2927, 210, 419, 228, 457, 232, 463, 242, 485, 971, 262, 523, 272, 545, 1091]