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.

A235508 Number of ways to write 2*n = p + q with q > 0 such that p, p*(p+1) - prime(p) and prime(q) - q + 1 are all prime.

Table of values

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

List of values

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