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.

A235330 Number of ways to write 2*n = p + q with p, q, prime(p) - p + 1 and prime(q) + q + 1 all prime.

Table of values

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

List of values

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