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.

A070675 Smallest m in range 2..n-1 such that m^10 == 1 mod n, or 1 if no such number exists.

Table of values

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

List of values

[1, 1, 2, 3, 4, 5, 6, 3, 8, 9, 2, 5, 12, 13, 4, 7, 16, 17, 18, 9, 8, 3, 22, 5, 4, 25, 26, 13, 28, 11, 2, 15, 2, 33, 6, 17, 36, 37, 14, 9, 4, 13, 42, 3, 19, 45, 46, 7, 48, 9, 16, 25, 52, 53, 4, 13, 20, 57, 58, 11, 3, 15, 8, 31, 14, 5, 66, 33, 22, 29, 5, 17, 72, 73]

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

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