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.

A220554 Number of ways to write 2n = p+q (q>0) with p, 2p+1 and (p-1)^2+q^2 all prime.

Table of values

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

List of values

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