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.

A022837 a(n) = c(0)*p(0) + ... + c(n)*p(n), where c(i) = 1 if a(i-1) < p(i) and c(i) = -1 if a(i-1) >= p(i) (p(0) = 1, p(i) = prime(i)).

Table of values

n a(n)
0 1
1 3
2 0
3 5
4 12
5 1
6 14
7 31
8 12
9 35
10 6
11 37
12 0
13 41
14 84
15 37
16 90
17 31
18 92
19 25
20 96
21 23
22 102
23 19
24 108
25 11
26 112
27 9
28 116
29 7
30 120
31 247
32 116
33 253
34 114
35 263
36 112
37 269
38 106
39 273
40 100
41 279
42 98
43 289
44 96
45 293
46 94
47 305
48 82
49 309
50 80
51 313
52 74
53 315
54 64
55 321
56 58
57 327
58 56
59 333
60 52
61 335

List of values

[1, 3, 0, 5, 12, 1, 14, 31, 12, 35, 6, 37, 0, 41, 84, 37, 90, 31, 92, 25, 96, 23, 102, 19, 108, 11, 112, 9, 116, 7, 120, 247, 116, 253, 114, 263, 112, 269, 106, 273, 100, 279, 98, 289, 96, 293, 94, 305, 82, 309, 80, 313, 74, 315, 64, 321, 58, 327, 56, 333, 52, 335]