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.

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

Table of values

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

List of values

[0, 1, 0, 6, 1, 2, 6, 0, 16, 18, 6, 22, 0, 3, 28, 15, 2, 0, 3, 6, 5, 21, 0, 46, 42, 16, 13, 0, 18, 58, 60, 6, 0, 33, 22, 35, 8, 0, 6, 13, 9, 41, 0, 28, 44, 6, 15, 0, 96, 2, 4, 34, 0, 53, 108, 3, 112, 0, 6, 48, 22, 5, 0, 42, 21, 130, 18, 0, 8, 46, 46, 6, 0, 42, 148]