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.

A046145 Smallest primitive root modulo n, or 0 if no root exists.

Table of values

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

List of values

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