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.

A198032 Numbers m such that the number of distinct residues of the congruence x^m (mod 2m+1) equals 2m+1, x=0..2m.

Table of values

n a(n)
0 0
1 1
2 7
3 17
4 19
5 25
6 27
7 43
8 47
9 55
10 57
11 59
12 61
13 71
14 77
15 79
16 91
17 93
18 97
19 101
20 107
21 109
22 117
23 127
24 133
25 143
26 145
27 147
28 149
29 151
30 159
31 161
32 163
33 167
34 169
35 177
36 185
37 195
38 197
39 199
40 203
41 205
42 207
43 223
44 227
45 235
46 241
47 257
48 259
49 263
50 267
51 271
52 275
53 277
54 289
55 291

List of values

[0, 1, 7, 17, 19, 25, 27, 43, 47, 55, 57, 59, 61, 71, 77, 79, 91, 93, 97, 101, 107, 109, 117, 127, 133, 143, 145, 147, 149, 151, 159, 161, 163, 167, 169, 177, 185, 195, 197, 199, 203, 205, 207, 223, 227, 235, 241, 257, 259, 263, 267, 271, 275, 277, 289, 291]