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.

A070773 Number of solutions to p(2m)-2p(m)=2n-1, where p(m) = m-th prime.

Table of values

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

List of values

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