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.

A202472 Goldbach's Problem extended to subtraction: number of decompositions of 2n into unordered differences of two primes, p, q, where p < 2n < q.

Table of values

n a(n)
1 0
2 1
3 1
4 2
5 2
6 3
7 2
8 3
9 3
10 3
11 2
12 6
13 4
14 3
15 6
16 3
17 4
18 6
19 4
20 5
21 8
22 4
23 4
24 7
25 6
26 4
27 9
28 8
29 4
30 11
31 5
32 5
33 11
34 6
35 8
36 9
37 4
38 7
39 11
40 7
41 4
42 13
43 7
44 5
45 15
46 7
47 8
48 13
49 8
50 9
51 11
52 7
53 7
54 13
55 10
56 5
57 13
58 7
59 7
60 19
61 9
62 8
63 17
64 9
65 10
66 16
67 9
68 9
69 15
70 12
71 7
72 19
73 9
74 7
75 19
76 9
77 12
78 17
79 8
80 14

List of values

[0, 1, 1, 2, 2, 3, 2, 3, 3, 3, 2, 6, 4, 3, 6, 3, 4, 6, 4, 5, 8, 4, 4, 7, 6, 4, 9, 8, 4, 11, 5, 5, 11, 6, 8, 9, 4, 7, 11, 7, 4, 13, 7, 5, 15, 7, 8, 13, 8, 9, 11, 7, 7, 13, 10, 5, 13, 7, 7, 19, 9, 8, 17, 9, 10, 16, 9, 9, 15, 12, 7, 19, 9, 7, 19, 9, 12, 17, 8, 14]