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.

A298398 a(n) is the smallest odd b > 1 such that (b^(2n) + 1)/2 has all prime divisors p == 1 (mod 2n).

Table of values

n a(n)
1 3
2 3
3 5
4 3
5 9
6 5
7 15
8 3
9 199
10 3
11 45
12 13
13 25
14 13
15 181
16 3
17 35
18 71
19 39
20 9
21 545
22 21
23 45
24 5
25 101
26 5
27 1405
28 13
29 59
30 107
31 61
32 3
33 5369
34 13
35 7069
36 305
37 221
38 39
39 131
40 3
41 165
42 169
43 85
44 43

List of values

[3, 3, 5, 3, 9, 5, 15, 3, 199, 3, 45, 13, 25, 13, 181, 3, 35, 71, 39, 9, 545, 21, 45, 5, 101, 5, 1405, 13, 59, 107, 61, 3, 5369, 13, 7069, 305, 221, 39, 131, 3, 165, 169, 85, 43]