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.

A216091 Numbers n such that k == k^(q-1) mod q for k = 1, 2, ..., q-1, where q = n^2+1.

Table of values

n a(n)
1 1
2 3
3 5
4 9
5 11
6 15
7 19
8 25
9 29
10 35
11 39
12 45
13 47
14 49
15 51
16 59
17 61
18 65
19 69
20 71
21 79
22 85
23 95
24 101
25 121
26 131
27 139
28 141
29 145
30 159
31 165
32 169
33 171
34 175
35 181
36 195
37 199
38 201
39 205
40 209
41 219
42 221
43 231
44 245
45 261
46 271
47 275
48 279
49 289
50 299
51 309
52 315
53 321
54 325
55 329
56 335
57 345

List of values

[1, 3, 5, 9, 11, 15, 19, 25, 29, 35, 39, 45, 47, 49, 51, 59, 61, 65, 69, 71, 79, 85, 95, 101, 121, 131, 139, 141, 145, 159, 165, 169, 171, 175, 181, 195, 199, 201, 205, 209, 219, 221, 231, 245, 261, 271, 275, 279, 289, 299, 309, 315, 321, 325, 329, 335, 345]