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.

A070681 Smallest m in range 1..phi(2n+1) such that 6^m == 1 mod 2n+1, or 0 if no such number exists.

Table of values

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

List of values

[0, 0, 1, 2, 0, 10, 12, 0, 16, 9, 0, 11, 5, 0, 14, 6, 0, 2, 4, 0, 40, 3, 0, 23, 14, 0, 26, 10, 0, 58, 60, 0, 12, 33, 0, 35, 36, 0, 10, 78, 0, 82, 16, 0, 88, 12, 0, 9, 12, 0, 10, 102, 0, 106, 108, 0, 112, 11, 0, 16, 110, 0, 25, 126, 0, 130, 18, 0, 136, 23, 0, 60]

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

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