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.

A090370 Least m > 3 such that gcd(n-1, m*n - 1) = m-1.

Table of values

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

List of values

[4, 5, 6, 4, 8, 5, 4, 6, 12, 4, 14, 8, 4, 5, 18, 4, 20, 5, 4, 12, 24, 4, 6, 14, 4, 5, 30, 4, 32, 5, 4, 18, 6, 4, 38, 20, 4, 5, 42, 4, 44, 5, 4, 24, 48, 4, 8, 6, 4, 5, 54, 4, 6, 5, 4, 30, 60, 4, 62, 32, 4, 5, 6, 4]