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.

A061781 Number of distinct sums p(i) + p(j) for 1<=i<=j<=n, p(k) = k-th prime.

Table of values

n a(n)
1 1
2 3
3 6
4 9
5 13
6 17
7 21
8 25
9 29
10 33
11 39
12 44
13 50
14 54
15 59
16 63
17 67
18 75
19 80
20 86
21 91
22 95
23 101
24 107
25 114
26 120
27 126
28 131
29 136
30 140
31 148
32 154
33 160
34 168
35 174
36 180
37 187
38 192
39 199
40 205
41 211
42 219
43 224
44 231
45 237
46 242
47 249
48 255
49 264
50 270
51 278
52 283
53 289
54 296
55 302
56 306
57 310
58 319

List of values

[1, 3, 6, 9, 13, 17, 21, 25, 29, 33, 39, 44, 50, 54, 59, 63, 67, 75, 80, 86, 91, 95, 101, 107, 114, 120, 126, 131, 136, 140, 148, 154, 160, 168, 174, 180, 187, 192, 199, 205, 211, 219, 224, 231, 237, 242, 249, 255, 264, 270, 278, 283, 289, 296, 302, 306, 310, 319]