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.

A219157 Number of prime pairs {p,q} with p>q and p-2,q+2 also prime such that p+(1+mod(-n,6))q=n if n is not congruent to 2 mod 6, and p-q=n and q if n=2 (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 1
12 1
13 0
14 1
15 0
16 1
17 1
18 1
19 0
20 0
21 0
22 2
23 1
24 2
25 1
26 1
27 1
28 2
29 1
30 1
31 1
32 1
33 1
34 1
35 1
36 2
37 2
38 1
39 1
40 1
41 2
42 1
43 1
44 1
45 0
46 2
47 0
48 2
49 2
50 1
51 1
52 2
53 3
54 1
55 0
56 2
57 1
58 1
59 0
60 2
61 2
62 1
63 2
64 1
65 2
66 1
67 0
68 1
69 0
70 2
71 1
72 2
73 1
74 1
75 1
76 2
77 1
78 2
79 2
80 1
81 1
82 2
83 2
84 2
85 1
86 1
87 2
88 1
89 1
90 2
91 2
92 2
93 1
94 2
95 2
96 0
97 1
98 3
99 1
100 0

List of values

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