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.

A070677 Smallest m in range 1..phi(n) such that 5^m == 1 mod n, or 0 if no such number exists.

Table of values

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

List of values

[0, 1, 2, 1, 0, 2, 6, 2, 6, 0, 5, 2, 4, 6, 0, 4, 16, 6, 9, 0, 6, 5, 22, 2, 0, 4, 18, 6, 14, 0, 3, 8, 10, 16, 0, 6, 36, 9, 4, 0, 20, 6, 42, 5, 0, 22, 46, 4, 42, 0, 16, 4, 52, 18, 0, 6, 18, 14, 29, 0, 30, 3, 6, 16, 0, 10, 22, 16, 22, 0, 5, 6, 72, 36, 0, 9, 30, 4, 39, 0]