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.

A046146 Largest 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 3
6 5
7 5
8 0
9 5
10 7
11 8
12 0
13 11
14 5
15 0
16 0
17 14
18 11
19 15
20 0
21 0
22 19
23 21
24 0
25 23
26 19
27 23
28 0
29 27
30 0
31 24
32 0
33 0
34 31
35 0
36 0
37 35
38 33
39 0
40 0
41 35
42 0
43 34
44 0
45 0
46 43
47 45
48 0
49 47
50 47
51 0
52 0
53 51
54 47
55 0
56 0
57 0
58 55
59 56
60 0
61 59
62 55
63 0
64 0
65 0
66 0
67 63
68 0
69 0
70 0
71 69
72 0
73 68
74 69
75 0
76 0
77 0
78 0
79 77
80 0
81 77
82 75
83 80
84 0
85 0

List of values

[0, 0, 1, 2, 3, 3, 5, 5, 0, 5, 7, 8, 0, 11, 5, 0, 0, 14, 11, 15, 0, 0, 19, 21, 0, 23, 19, 23, 0, 27, 0, 24, 0, 0, 31, 0, 0, 35, 33, 0, 0, 35, 0, 34, 0, 0, 43, 45, 0, 47, 47, 0, 0, 51, 47, 0, 0, 0, 55, 56, 0, 59, 55, 0, 0, 0, 0, 63, 0, 0, 0, 69, 0, 68, 69, 0, 0, 0, 0, 77, 0, 77, 75, 80, 0, 0]