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.

A003561 Least number m such that 5^m == +- 1 (mod 5n + 1).

Table of values

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

List of values

[1, 5, 4, 3, 2, 3, 6, 10, 11, 16, 6, 15, 10, 5, 9, 27, 21, 12, 8, 25, 26, 36, 14, 55, 3, 65, 16, 23, 36, 75, 4, 33, 41, 18, 20, 15, 6, 19, 42, 11, 51, 35, 18, 16, 56, 30, 29, 20, 20, 25, 64, 21, 18, 27, 22, 70, 20, 96, 36, 21, 48, 155, 39, 53, 27, 165, 12, 15]