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.

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

Table of values

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

List of values

[0, 1, 0, 2, 4, 0, 6, 2, 0, 4, 5, 0, 3, 6, 0, 4, 16, 0, 18, 4, 0, 5, 11, 0, 20, 3, 0, 6, 28, 0, 30, 8, 0, 16, 12, 0, 18, 18, 0, 4, 8, 0, 42, 10, 0, 11, 23, 0, 42, 20, 0, 6, 52, 0, 20, 6, 0, 28, 29, 0, 10, 30, 0, 16, 12, 0, 22, 16, 0, 12, 35, 0, 12, 18, 0, 18, 30, 0]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.