A308695 - cp's OEIS frontend

A308695 a(n) is the minimum positive integer m such that m * 2^(n + 2) + 1 is a prime number which does not divide ((F(n + 2) - 1)^m - 1)/(F(n + 2) - 2), where F(n) is the n-th Fermat number (A000215).

n	a(n)
0	1
1	2
2	1
3	8
4	4
5	2
6	1
7	128
8	64
9	32
10	16
11	8
12	4
13	2
14	1
15	6300
16	3150
17	26
18	13
19	579
20	1069378
21	534689
22	10
23	5
24	387304
25	193652
26	96826
27	48413
28	141015
29	298082
30	149041
31	2958
32	1479
33	51418638746
34	25709319373
35	20
36	10
37	5
38	6
39	3

[1, 2, 1, 8, 4, 2, 1, 128, 64, 32, 16, 8, 4, 2, 1, 6300, 3150, 26, 13, 579, 1069378, 534689, 10, 5, 387304, 193652, 96826, 48413, 141015, 298082, 149041, 2958, 1479, 51418638746, 25709319373, 20, 10, 5, 6, 3]

cp's OEIS Frontend

A308695 a(n) is the minimum positive integer m such that m * 2^(n + 2) + 1 is a prime number which does not divide ((F(n + 2) - 1)^m - 1)/(F(n + 2) - 2), where F(n) is the n-th Fermat number (A000215).

Table of values

List of values