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.

A298076 Least k > 1 such that all divisors of (k^n-1)/(k-1) are == 1 (mod n).

Table of values

n a(n)
1 2
2 2
3 2
4 4
5 2
6 6
7 2
8 16
9 8
10 10
11 2
12 1260
13 2
14 28
15 24
16 16
17 2
18 162
19 2
20 2080
21 6
22 22
23 2
24 207480
25 7
26 52
27 27
28 420
29 2
30 43890
31 2
32 256
33 21
34 102
35 370
36 5988060
37 2
38 190
39 12
40 7412680
41 2
42 2016
43 2
44 507496
45 495
46 46
47 2
48 1486179696
49 68
50 5050
51 476
52 66300
53 2
54 3292758
55 274
56 72682120

List of values

[2, 2, 2, 4, 2, 6, 2, 16, 8, 10, 2, 1260, 2, 28, 24, 16, 2, 162, 2, 2080, 6, 22, 2, 207480, 7, 52, 27, 420, 2, 43890, 2, 256, 21, 102, 370, 5988060, 2, 190, 12, 7412680, 2, 2016, 2, 507496, 495, 46, 2, 1486179696, 68, 5050, 476, 66300, 2, 3292758, 274, 72682120]