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.

A237715 Number of ordered ways to write n = p + q (q > 0) with p, prime(p) - p + 1 and prime(prime(q)) - prime(q) + 1 all prime.

Table of values

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

List of values

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