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.

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

Table of values

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

List of values

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