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.

A298310 Least k > 1 such that all divisors d of (k^(2n+1)+1)/(k+1) satisfy d == 1 (mod 2n+1).

Table of values

n a(n)
0 2
1 3
2 2
3 2
4 9
5 2
6 2
7 15
8 2
9 2
10 15
11 2
12 32
13 81
14 2
15 2
16 55
17 21
18 2
19 39
20 2
21 2
22 4141
23 2
24 18
25 51
26 2
27 551
28 39
29 2
30 2
31 21267
32 21
33 2
34 1012
35 2
36 2
37 826
38 330
39 2
40 729
41 2
42 136
43 204
44 2
45 3
46 280
47 20
48 2

List of values

[2, 3, 2, 2, 9, 2, 2, 15, 2, 2, 15, 2, 32, 81, 2, 2, 55, 21, 2, 39, 2, 2, 4141, 2, 18, 51, 2, 551, 39, 2, 2, 21267, 21, 2, 1012, 2, 2, 826, 330, 2, 729, 2, 136, 204, 2, 3, 280, 20, 2]