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.

A003562 Least number m such that 6^m == +- 1 (mod 6n + 1).

Table of values

n a(n)
1 1
2 6
3 9
4 5
5 3
6 2
7 3
8 7
9 10
10 30
11 33
12 18
13 39
14 16
15 12
16 6
17 51
18 54
19 11
20 55
21 63
22 18
23 23
24 14
25 75
26 78
27 27
28 78
29 10
30 30
31 80
32 48
33 99
34 40
35 105
36 3
37 111
38 114
39 23
40 10
41 36
42 110
43 4
44 26
45 135
46 138
47 141
48 136
49 58
50 6
51 51
52 26
53 35
54 60
55 165
56 28
57 49
58 58
59 35
60 171
61 183
62 186
63 63
64 10
65 176

List of values

[1, 6, 9, 5, 3, 2, 3, 7, 10, 30, 33, 18, 39, 16, 12, 6, 51, 54, 11, 55, 63, 18, 23, 14, 75, 78, 27, 78, 10, 30, 80, 48, 99, 40, 105, 3, 111, 114, 23, 10, 36, 110, 4, 26, 135, 138, 141, 136, 58, 6, 51, 26, 35, 60, 165, 28, 49, 58, 35, 171, 183, 186, 63, 10, 176]