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.

A293909 Number of Goldbach partitions (p,q) of 2n, p <= q, such that both 2n-2 and 2n+2 have a Goldbach partition with a greater difference between its prime parts than q-p.

Table of values

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

List of values

[0, 0, 0, 0, 1, 1, 1, 1, 2, 1, 2, 3, 2, 1, 3, 1, 3, 3, 2, 2, 4, 2, 3, 5, 3, 2, 5, 2, 3, 6, 2, 4, 5, 2, 4, 6, 4, 4, 6, 4, 4, 8, 4, 3, 9, 3, 4, 4, 3, 3, 8, 4, 5, 8, 5, 6, 10, 5, 5, 10, 4, 4, 8, 3, 5, 9, 5, 4, 8, 6, 7, 10, 5, 5, 11, 3, 7, 10, 5, 7, 9, 5, 5, 13, 8, 5]