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.

A346988 a(n) is the smallest k > n such that n^(k-n) == 1 (mod k).

Table of values

n a(n)
1 2
2 20737
3 9299
4 7
5 13
6 311
7 15
8 127
9 17
10 37
11 14
12 23
13 17
14 157
15 106
16 31
17 29
18 312953
19 45
20 95951
21 41
22 91
23 33
24 47
25 28
26 95
27 35
28 271
29 35
30 9629
31 39
32 311
33 85
34 397
35 46
36 71
37 43
38 1793
39 95
40 79
41 61
42 821
43 51
44 18881
45 67
46 103
47 51
48 12409
49 73
50 409969
51 65
52 87
53 65
54 71233
55 63
56 155
57 65
58 69
59 87
60 1962251
61 91
62 2443783
63 155

List of values

[2, 20737, 9299, 7, 13, 311, 15, 127, 17, 37, 14, 23, 17, 157, 106, 31, 29, 312953, 45, 95951, 41, 91, 33, 47, 28, 95, 35, 271, 35, 9629, 39, 311, 85, 397, 46, 71, 43, 1793, 95, 79, 61, 821, 51, 18881, 67, 103, 51, 12409, 73, 409969, 65, 87, 65, 71233, 63, 155, 65, 69, 87, 1962251, 91, 2443783, 155]