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.

A070670 Smallest m in range 2..n-1 such that m^5 == 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 1
8 1
9 1
10 1
11 3
12 1
13 1
14 1
15 1
16 1
17 1
18 1
19 1
20 1
21 1
22 3
23 1
24 1
25 6
26 1
27 1
28 1
29 1
30 1
31 2
32 1
33 4
34 1
35 1
36 1
37 1
38 1
39 1
40 1
41 10
42 1
43 1
44 5
45 1
46 1
47 1
48 1
49 1
50 11
51 1
52 1
53 1
54 1
55 16
56 1
57 1
58 1
59 1
60 1
61 9
62 33
63 1
64 1
65 1
66 25
67 1
68 1
69 1
70 1
71 5
72 1
73 1
74 1
75 16
76 1
77 15
78 1
79 1
80 1
81 1
82 37
83 1
84 1
85 1
86 1
87 1
88 9
89 1
90 1

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 6, 1, 1, 1, 1, 1, 2, 1, 4, 1, 1, 1, 1, 1, 1, 1, 10, 1, 1, 5, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 16, 1, 1, 1, 1, 1, 9, 33, 1, 1, 1, 25, 1, 1, 1, 1, 5, 1, 1, 1, 16, 1, 15, 1, 1, 1, 1, 37, 1, 1, 1, 1, 1, 9, 1, 1]