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.

A238756 Number of ordered ways to write n = k + m (k > 0 and m > 0) such that 2*k + 1, prime(prime(k)) - prime(k) + 1 and prime(prime(m)) - prime(m) + 1 are all prime.

Table of values

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

List of values

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