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.

A066858 Smallest k>1 such that for each integer x, x^k=x or x^k=0 (mod n); or 0 if no such k exists.

Table of values

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

List of values

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