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.

A096226 a(n) is the least exponent k > 1 such that m^k is congruent to m modulo n for all natural numbers m, or a(n) = 1 if no such k exists.

Table of values

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

List of values

[2, 2, 3, 1, 5, 3, 7, 1, 1, 5, 11, 1, 13, 7, 5, 1, 17, 1, 19, 1, 7, 11, 23, 1, 1, 13, 1, 1, 29, 5, 31, 1, 11, 17, 13, 1, 37, 19, 13, 1, 41, 7, 43, 1, 1, 23, 47, 1, 1, 1, 17, 1, 53, 1, 21, 1, 19, 29, 59, 1, 61, 31, 1, 1, 13, 11, 67, 1, 23, 13, 71, 1, 73, 37, 1, 1, 31, 13, 79, 1, 1, 41, 83, 1]