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.

A197930 Numbers n such that the number of distinct residues in x^(n-1) (mod n), x=0..n-1, equals n.

Table of values

n a(n)
1 1
2 2
3 6
4 10
5 14
6 22
7 26
8 30
9 34
10 38
11 42
12 46
13 58
14 62
15 74
16 78
17 82
18 86
19 94
20 102
21 106
22 110
23 114
24 118
25 122
26 134
27 138
28 142
29 146
30 158
31 166
32 170
33 174
34 178
35 182
36 194
37 202
38 206
39 210
40 214
41 218
42 222
43 226
44 230
45 254
46 258
47 262
48 266
49 274
50 278
51 282
52 290
53 298
54 302
55 314
56 318

List of values

[1, 2, 6, 10, 14, 22, 26, 30, 34, 38, 42, 46, 58, 62, 74, 78, 82, 86, 94, 102, 106, 110, 114, 118, 122, 134, 138, 142, 146, 158, 166, 170, 174, 178, 182, 194, 202, 206, 210, 214, 218, 222, 226, 230, 254, 258, 262, 266, 274, 278, 282, 290, 298, 302, 314, 318]