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.

A219185 Number of prime pairs {p,q} (p>q) with 3(p-q)-1 and 3(p-q)+1 both prime such that p+(1+(n mod 2))q=n.

Table of values

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

List of values

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