A298299 - cp's OEIS frontend

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

n	a(n)
1	2
2	2
3	6
4	2
5	10
6	6
7	14
8	2
9	36
10	20
11	66
12	18
13	26
14	28
15	120
16	2
17	170
18	6
19	570
20	140
21	2184
22	88
23	184
24	42
25	110
26	312
27	1440
28	42
29	116
30	9060
31	124
32	2
33	7656
34	34
35	13650
36	132
37	74
38	228
39	7800
40	40
41	1066
42	4158
43	430
44	132
45	6283590
46	46
47	94
48	12
49	1246
50	1960

[2, 2, 6, 2, 10, 6, 14, 2, 36, 20, 66, 18, 26, 28, 120, 2, 170, 6, 570, 140, 2184, 88, 184, 42, 110, 312, 1440, 42, 116, 9060, 124, 2, 7656, 34, 13650, 132, 74, 228, 7800, 40, 1066, 4158, 430, 132, 6283590, 46, 94, 12, 1246, 1960]

cp's OEIS Frontend

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

Table of values

List of values