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.

A091733 a(n) is the least m > 1 such that m^3 = 1 (mod n).

Table of values

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

List of values

[2, 3, 4, 5, 6, 7, 2, 9, 4, 11, 12, 13, 3, 9, 16, 17, 18, 7, 7, 21, 4, 23, 24, 25, 26, 3, 10, 9, 30, 31, 5, 33, 34, 35, 11, 13, 10, 7, 16, 41, 42, 25, 6, 45, 16, 47, 48, 49, 18, 51, 52, 9, 54, 19, 56, 9, 7, 59, 60, 61, 13, 5, 4, 65, 16, 67, 29, 69, 70, 11, 72, 25, 8, 47, 76, 45, 23, 55, 23]

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

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