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.

A061784 Number of sums prime(i) + prime(j) that occur more than once for 1 <= i <= j <= n, where prime(k) = k-th prime.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 2
6 4
7 7
8 11
9 16
10 22
11 27
12 34
13 41
14 51
15 61
16 73
17 86
18 96
19 110
20 124
21 140
22 158
23 175
24 193
25 211
26 231
27 252
28 275
29 299
30 325
31 348
32 374
33 401
34 427
35 456
36 486
37 516
38 549
39 581
40 615
41 650
42 684
43 722
44 759
45 798
46 839
47 879
48 921
49 961
50 1005
51 1048
52 1095
53 1142
54 1189
55 1238

List of values

[0, 0, 0, 1, 2, 4, 7, 11, 16, 22, 27, 34, 41, 51, 61, 73, 86, 96, 110, 124, 140, 158, 175, 193, 211, 231, 252, 275, 299, 325, 348, 374, 401, 427, 456, 486, 516, 549, 581, 615, 650, 684, 722, 759, 798, 839, 879, 921, 961, 1005, 1048, 1095, 1142, 1189, 1238]