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.

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

Table of values

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

List of values

[2, 2, 2, 4, 2, 3, 2, 8, 8, 5, 2, 4, 2, 7, 4, 16, 2, 9, 2, 5, 6, 11, 2, 9, 7, 13, 26, 4, 2, 6, 2, 32, 10, 17, 6, 9, 2, 19, 12, 16, 2, 7, 2, 12, 8, 23, 2, 16, 18, 25, 16, 9, 2, 27, 10, 8, 18, 29, 2, 16, 2, 31, 8, 64, 5, 3, 2, 17, 22, 11, 2, 9, 2, 37, 24, 20, 21]