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.

A232928 a(n) is the smallest q such that the primes<=q generate the multiplicative group modulo n.

Table of values

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

List of values

[2, 3, 2, 5, 3, 5, 2, 3, 2, 7, 2, 3, 7, 5, 3, 5, 2, 11, 5, 7, 5, 13, 2, 5, 2, 5, 2, 11, 3, 5, 5, 3, 3, 7, 2, 3, 7, 11, 3, 11, 3, 7, 7, 5, 5, 13, 3, 3, 5, 5, 2, 5, 3, 11, 5, 3, 2, 13, 2, 3, 5, 5, 3, 7, 2, 5, 5, 19, 7, 13, 5, 5, 7, 7, 3, 7, 3, 11, 2, 5, 2, 13, 3, 3, 5, 7, 3, 11, 3, 5, 11, 5, 7, 13, 5, 3, 5, 11, 2, 7, 3, 11, 13, 3, 2, 7, 3, 7, 11, 11, 3, 13, 7, 7, 7, 11, 11, 17]