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.

A342144 Numbers m with integer solution to x^x == (x+1)^(x+1) (mod m) with x > 0.

Table of values

n a(n)
1 1
2 3
3 5
4 7
5 11
6 13
7 15
8 17
9 19
10 21
11 23
12 29
13 31
14 33
15 35
16 37
17 39
18 41
19 43
20 47
21 49
22 51
23 53
24 55
25 57
26 59
27 61
28 65
29 67
30 69
31 71
32 73
33 77
34 79
35 83
36 85
37 87
38 89
39 91
40 93
41 95
42 97
43 101
44 103
45 105
46 107
47 109
48 111
49 113
50 115
51 119
52 123
53 127
54 129
55 131
56 133
57 137
58 139
59 141
60 143
61 145
62 147
63 149
64 151
65 155
66 157
67 159
68 161
69 163
70 167

List of values

[1, 3, 5, 7, 11, 13, 15, 17, 19, 21, 23, 29, 31, 33, 35, 37, 39, 41, 43, 47, 49, 51, 53, 55, 57, 59, 61, 65, 67, 69, 71, 73, 77, 79, 83, 85, 87, 89, 91, 93, 95, 97, 101, 103, 105, 107, 109, 111, 113, 115, 119, 123, 127, 129, 131, 133, 137, 139, 141, 143, 145, 147, 149, 151, 155, 157, 159, 161, 163, 167]

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

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