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.

A236541 Number of ways to write 2*n = k + m with 0 < k <= m such that prime(k) + m and k + prime(m) are both prime.

Table of values

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

List of values

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