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.

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

Table of values

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

List of values

[0, 0, 4, 6, 0, 1, 2, 0, 16, 6, 0, 11, 20, 0, 4, 30, 0, 12, 9, 0, 40, 42, 0, 23, 42, 0, 52, 4, 0, 29, 15, 0, 4, 66, 0, 35, 36, 0, 6, 26, 0, 41, 16, 0, 8, 6, 0, 12, 16, 0, 100, 102, 0, 53, 54, 0, 112, 44, 0, 48, 11, 0, 100, 126, 0, 65, 6, 0, 136, 138, 0, 2, 4, 0, 148]

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

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