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.

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

Table of values

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

List of values

[0, 1, 0, 1, 2, 0, 3, 1, 0, 2, 5, 0, 3, 3, 0, 2, 8, 0, 9, 2, 0, 5, 11, 0, 10, 3, 0, 3, 14, 0, 15, 4, 0, 8, 6, 0, 9, 9, 0, 2, 4, 0, 21, 5, 0, 11, 23, 0, 21, 10, 0, 3, 26, 0, 10, 3, 0, 14, 29, 0, 5, 15, 0, 8, 6, 0, 11, 8, 0, 6, 35, 0, 6, 9, 0, 9, 15, 0, 39, 2, 0, 4, 41, 0]