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.

A219558 Number of odd prime pairs {p,q} (p>q) such that p+(1+(n mod 2))q=n and ((p-1-(n mod 2))/q)=((q+1)/p)=1 where (-) denotes the Legendre symbol.

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

List of values

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