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.

A216090 Numbers n such that k^(n-1) == k (mod n) for every k = 1, 2, ..., n-1.

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 46
12 58
13 62
14 74
15 82
16 86
17 94
18 106
19 118
20 122
21 134
22 142
23 146
24 158
25 166
26 178
27 182
28 194
29 202
30 206
31 214
32 218
33 226
34 254
35 262
36 274
37 278
38 298
39 302
40 314
41 326
42 334
43 346
44 358
45 362
46 382
47 386
48 394
49 398
50 422
51 446
52 454
53 458
54 466
55 478
56 482

List of values

[1, 2, 6, 10, 14, 22, 26, 30, 34, 38, 46, 58, 62, 74, 82, 86, 94, 106, 118, 122, 134, 142, 146, 158, 166, 178, 182, 194, 202, 206, 214, 218, 226, 254, 262, 274, 278, 298, 302, 314, 326, 334, 346, 358, 362, 382, 386, 394, 398, 422, 446, 454, 458, 466, 478, 482]