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.

A232930 For each complex primitive Dirichlet character chi modulo n, let f(chi) be the least positive integer k for which chi(k) is not in the set {0,1}. Then a(n) is the sum of f(chi) over all such chi.

Table of values

n a(n)
3 2
4 3
5 6
6 0
7 11
8 8
9 8
10 0
11 18
12 5
13 22
14 0
15 11
16 12
17 31
18 0
19 34
20 17
21 10
22 0
23 45
24 20
25 32
26 0
27 24
28 17
29 54
30 0
31 63
32 24
33 21
34 0
35 30
36 20
37 70
38 0
39 27
40 22
41 79
42 0
43 84
44 27
45 24
46 0
47 93
48 20
49 72
50 0
51 36
52 33
53 102
54 0
55 55
56 38
57 37
58 0
59 114
60 27
61 118
62 0
63 52
64 48
65 69
66 0
67 130
68 47
69 42
70 0
71 143
72 40
73 151
74 0
75 32
76 55
77 90
78 0
79 155
80 52
81 72
82 0
83 162
84 33
85 96
86 0
87 57
88 56
89 181
90 0
91 114
92 63
93 58
94 0
95 107
96 40
97 193
98 0
99 72
100 48
101 198
102 0
103 203
104 78
105 39
106 0
107 210
108 60
109 216
110 0
111 79
112 60
113 225
114 0
115 126
116 85
117 100
118 0
119 159
120 46

List of values

[2, 3, 6, 0, 11, 8, 8, 0, 18, 5, 22, 0, 11, 12, 31, 0, 34, 17, 10, 0, 45, 20, 32, 0, 24, 17, 54, 0, 63, 24, 21, 0, 30, 20, 70, 0, 27, 22, 79, 0, 84, 27, 24, 0, 93, 20, 72, 0, 36, 33, 102, 0, 55, 38, 37, 0, 114, 27, 118, 0, 52, 48, 69, 0, 130, 47, 42, 0, 143, 40, 151, 0, 32, 55, 90, 0, 155, 52, 72, 0, 162, 33, 96, 0, 57, 56, 181, 0, 114, 63, 58, 0, 107, 40, 193, 0, 72, 48, 198, 0, 203, 78, 39, 0, 210, 60, 216, 0, 79, 60, 225, 0, 126, 85, 100, 0, 159, 46]