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.

A022833 a(0)=2; thereafter a(n) = a(n-1) + prime(n) if a(n-1) < prime(n), otherwise a(n) = a(n-1) - prime(n). Cf. A008348.

Table of values

n a(n)
0 2
1 0
2 3
3 8
4 1
5 12
6 25
7 8
8 27
9 4
10 33
11 2
12 39
13 80
14 37
15 84
16 31
17 90
18 29
19 96
20 25
21 98
22 19
23 102
24 13
25 110
26 9
27 112
28 5
29 114
30 1
31 128
32 259
33 122
34 261
35 112
36 263
37 106
38 269
39 102
40 275
41 96
42 277
43 86
44 279
45 82
46 281
47 70
48 293
49 66
50 295
51 62
52 301
53 60
54 311
55 54
56 317
57 48
58 319
59 42
60 323
61 40

List of values

[2, 0, 3, 8, 1, 12, 25, 8, 27, 4, 33, 2, 39, 80, 37, 84, 31, 90, 29, 96, 25, 98, 19, 102, 13, 110, 9, 112, 5, 114, 1, 128, 259, 122, 261, 112, 263, 106, 269, 102, 275, 96, 277, 86, 279, 82, 281, 70, 293, 66, 295, 62, 301, 60, 311, 54, 317, 48, 319, 42, 323, 40]