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.

A084680 Order of 10 modulo n [i.e., least m such that 10^m = 1 (mod n)] or 0 when no such number exists.

Table of values

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

List of values

[1, 0, 1, 0, 0, 0, 6, 0, 1, 0, 2, 0, 6, 0, 0, 0, 16, 0, 18, 0, 6, 0, 22, 0, 0, 0, 3, 0, 28, 0, 15, 0, 2, 0, 0, 0, 3, 0, 6, 0, 5, 0, 21, 0, 0, 0, 46, 0, 42, 0, 16, 0, 13, 0, 0, 0, 18, 0, 58, 0, 60, 0, 6, 0, 0, 0, 33, 0, 22, 0, 35, 0, 8, 0, 0, 0, 6, 0, 13, 0, 9, 0, 41, 0, 0, 0, 28, 0, 44, 0, 6, 0, 15, 0, 0, 0]