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.

A352597 a(n) is the smallest k > 1 such that k^n + 1 has all prime divisors p == 1 (mod n).

Table of values

n a(n)
1 2
2 2
3 6
4 2
5 10
6 6
7 28
8 2
9 18
10 10
11 22
12 6
13 52
14 14
15 60
16 2
17 102
18 36
19 190
20 20
21 756
22 66
23 46
24 18
25 2550
26 26
27 2970
28 28
29 58
30 120
31 310
32 2
33 330
34 170
35 11550
36 6
37 148
38 570
39 156
40 140
41 82
42 2184
43 172
44 88
45 3040020
46 184
47 282
48 42
49 7252
50 110
51 7548
52 312
53 106
54 1440
55 41800
56 42
57 11172

List of values

[2, 2, 6, 2, 10, 6, 28, 2, 18, 10, 22, 6, 52, 14, 60, 2, 102, 36, 190, 20, 756, 66, 46, 18, 2550, 26, 2970, 28, 58, 120, 310, 2, 330, 170, 11550, 6, 148, 570, 156, 140, 82, 2184, 172, 88, 3040020, 184, 282, 42, 7252, 110, 7548, 312, 106, 1440, 41800, 42, 11172]