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.

A138319 Number of ways in which 2n can be represented as p+g, where p is a prime and g is a prime primitive root of p.

Table of values

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

List of values

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