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.

A105222 Smallest integer m > 1 such that m^(n-1) == 1 (mod n).

Table of values

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

List of values

[2, 3, 2, 5, 2, 7, 2, 9, 8, 11, 2, 13, 2, 15, 4, 17, 2, 19, 2, 21, 8, 23, 2, 25, 7, 27, 26, 9, 2, 31, 2, 33, 10, 35, 6, 37, 2, 39, 14, 41, 2, 43, 2, 45, 8, 47, 2, 49, 18, 51, 16, 9, 2, 55, 21, 57, 20, 59, 2, 61, 2, 63, 8, 65, 8, 25, 2, 69, 22, 11, 2, 73, 2, 75, 26]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.