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.

A218867 Number of prime pairs {p,q} with p>q and {p-4,q+4} also prime such that p+(1+(n mod 6))q=n if n is not congruent to 4 (mod 6), and p-q=n and q if n=4 (mod 6).

Table of values

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

List of values

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