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.

A111076 Smallest positive number of maximal order mod n.

Table of values

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

List of values

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