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.

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

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 2, 1, 4, 1, 1, 1, 3, 9, 1, 1, 1, 7, 7, 1, 4, 1, 1, 1, 1, 3, 10, 9, 1, 1, 5, 1, 1, 1, 11, 13, 10, 7, 16, 1, 1, 25, 6, 1, 16, 1, 1, 1, 18, 1, 1, 9, 1, 19, 1, 9, 7, 1, 1, 1, 13, 5, 4, 1, 16, 1, 29, 1, 1, 11, 1, 25, 8, 47, 1, 45, 23, 55, 23, 1, 28, 1, 1, 25]