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.

A372771 Numbers m such that the congruence x^(m+1) == m (mod m+1) is solvable.

Table of values

n a(n)
1 1
2 2
3 4
4 6
5 8
6 9
7 10
8 12
9 14
10 16
11 18
12 20
13 22
14 24
15 25
16 26
17 28
18 30
19 32
20 33
21 34
22 36
23 38
24 40
25 42
26 44
27 46
28 48
29 49
30 50
31 52
32 54
33 56
34 57
35 58
36 60
37 62
38 64
39 66
40 68
41 70
42 72
43 73
44 74
45 76
46 78
47 80
48 81
49 82
50 84
51 86
52 88
53 90
54 92
55 94
56 96
57 98
58 100
59 102
60 104
61 105
62 106
63 108
64 110

List of values

[1, 2, 4, 6, 8, 9, 10, 12, 14, 16, 18, 20, 22, 24, 25, 26, 28, 30, 32, 33, 34, 36, 38, 40, 42, 44, 46, 48, 49, 50, 52, 54, 56, 57, 58, 60, 62, 64, 66, 68, 70, 72, 73, 74, 76, 78, 80, 81, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 105, 106, 108, 110]