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.

A279481 Count the primes appearing in each interval [p,q] where (p,q) is a Goldbach partition of 2n, and then add the results.

Table of values

n a(n)
1 0
2 0
3 1
4 2
5 4
6 2
7 5
8 8
9 6
10 9
11 13
12 12
13 14
14 10
15 12
16 12
17 24
18 22
19 9
20 20
21 24
22 27
23 29
24 38
25 36
26 24
27 39
28 29
29 33
30 43
31 24
32 58
33 58
34 17
35 52
36 60
37 53
38 63
39 80
40 46
41 54
42 87
43 70
44 46
45 100
46 62
47 58
48 87
49 31
50 79
51 104
52 71
53 87
54 119
55 99
56 116
57 152
58 114
59 94
60 181
61 54
62 82
63 144
64 39
65 116
66 133

List of values

[0, 0, 1, 2, 4, 2, 5, 8, 6, 9, 13, 12, 14, 10, 12, 12, 24, 22, 9, 20, 24, 27, 29, 38, 36, 24, 39, 29, 33, 43, 24, 58, 58, 17, 52, 60, 53, 63, 80, 46, 54, 87, 70, 46, 100, 62, 58, 87, 31, 79, 104, 71, 87, 119, 99, 116, 152, 114, 94, 181, 54, 82, 144, 39, 116, 133]