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.

A268466 Smallest m > 1 such that m^m == 1 (mod n).

Table of values

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

List of values

[2, 3, 2, 5, 4, 7, 6, 9, 8, 11, 5, 13, 3, 9, 4, 17, 4, 19, 9, 21, 8, 5, 22, 25, 24, 3, 26, 9, 7, 31, 6, 33, 10, 35, 6, 37, 9, 9, 8, 41, 10, 43, 6, 5, 8, 47, 46, 49, 18, 51, 4, 9, 13, 55, 12, 9, 20, 7, 29, 61, 15, 35, 8, 65, 8, 25, 22, 69, 22, 51, 5, 73, 18, 9, 26, 9, 12, 79, 24, 81]