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.

A064365 a(0) = 0; thereafter a(n) = a(n-1)-prime(n) if positive and new, otherwise a(n) = a(n-1)+prime(n), where prime(n) is the n-th prime.

Table of values

n a(n)
0 0
1 2
2 5
3 10
4 3
5 14
6 1
7 18
8 37
9 60
10 31
11 62
12 25
13 66
14 23
15 70
16 17
17 76
18 15
19 82
20 11
21 84
22 163
23 80
24 169
25 72
26 173
27 276
28 383
29 274
30 161
31 34
32 165
33 28
34 167
35 316
36 467
37 310
38 147
39 314
40 141
41 320
42 139
43 330
44 137
45 334
46 135
47 346
48 123
49 350
50 121
51 354
52 115
53 356
54 105
55 362
56 99
57 368
58 97
59 374
60 93

List of values

[0, 2, 5, 10, 3, 14, 1, 18, 37, 60, 31, 62, 25, 66, 23, 70, 17, 76, 15, 82, 11, 84, 163, 80, 169, 72, 173, 276, 383, 274, 161, 34, 165, 28, 167, 316, 467, 310, 147, 314, 141, 320, 139, 330, 137, 334, 135, 346, 123, 350, 121, 354, 115, 356, 105, 362, 99, 368, 97, 374, 93]