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.

A346669 Numbers r such that the number of nonnegative m < r such that m^k == m (mod r) is equal to k*(the number of nonnegative m < r such that -m^k == m (mod r)), where k = 2^A007814(r-1) + 1.

Table of values

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

List of values

[3, 5, 7, 11, 13, 15, 17, 19, 23, 27, 29, 31, 35, 37, 39, 41, 43, 47, 51, 53, 55, 57, 59, 61, 67, 71, 73, 75, 79, 83, 85, 87, 89, 91, 95, 97, 101, 103, 107, 109, 111, 113, 115, 119, 123, 125, 127, 131, 135, 137, 139, 143, 149, 151, 155, 157, 159, 163, 167, 173, 175, 179, 181, 183, 187]