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.

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

Table of values

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

List of values

[0, 1, 2, 2, 1, 2, 3, 2, 6, 1, 0, 2, 12, 3, 2, 4, 16, 6, 3, 2, 6, 0, 22, 2, 5, 12, 18, 6, 28, 2, 30, 8, 0, 16, 3, 6, 6, 3, 12, 2, 40, 6, 7, 0, 6, 22, 46, 4, 21, 5, 16, 12, 26, 18, 0, 6, 6, 28, 58, 2, 4, 30, 6, 16, 12, 0, 66, 16, 22, 3, 70, 6, 72, 6, 10, 6, 0, 12, 39, 4]