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.

A235189 Number of ways to write n = (1 + (n mod 2))*p + q with p < n/2 such that p, q and prime(p) - p + 1 are all prime.

Table of values

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

List of values

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