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.

A335225 Partitions of a stronger form of Goldbach Conjecture: the number of decompositions of an even number 2n into the sum of two odd prime numbers p and q with 0 <= q-p < n.

Table of values

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

List of values

[0, 0, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 3, 1, 2, 2, 2, 1, 2, 1, 2, 4, 2, 2, 3, 1, 2, 3, 2, 2, 2, 1, 3, 4, 1, 2, 5, 1, 2, 3, 2, 3, 4, 3, 2, 4, 3, 3, 5, 2, 2, 6, 2, 2, 5, 1, 3, 4, 3, 2, 4, 4, 4, 6, 4, 3, 7, 2, 4, 6, 2, 4, 5, 2, 3, 5, 4, 3, 5, 3, 3, 6, 2, 4, 6, 2, 4, 5, 2, 3, 6, 3]