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.

A330279 Numbers k such that x^k == k (mod k + 1) has multiple solutions for 0 <= x < k.

Table of values

n a(n)
1 27
2 51
3 65
4 69
5 75
6 111
7 123
8 129
9 147
10 153
11 171
12 175
13 185
14 189
15 195
16 207
17 231
18 237
19 243
20 245
21 267
22 275
23 279
24 285
25 291
26 303
27 309
28 315
29 321
30 343
31 363
32 365
33 369
34 387
35 395
36 405
37 411
38 417
39 425
40 429
41 435
42 441
43 447
44 489
45 495
46 505
47 507
48 519
49 531
50 555
51 567
52 573
53 591
54 597

List of values

[27, 51, 65, 69, 75, 111, 123, 129, 147, 153, 171, 175, 185, 189, 195, 207, 231, 237, 243, 245, 267, 275, 279, 285, 291, 303, 309, 315, 321, 343, 363, 365, 369, 387, 395, 405, 411, 417, 425, 429, 435, 441, 447, 489, 495, 505, 507, 519, 531, 555, 567, 573, 591, 597]