A260350 - cp's OEIS frontend

A260350 Define g(k) = min(n: n >= 0, 2^n + k prime). Then a(n) = min(odd k: g(k) = n).

n	a(n)
0	1
1	3
2	7
3	23
4	31
5	47
6	199
7	83
8	61
9	257
10	139
11	953
12	991
13	647
14	1735
15	383
16	511
17	1337
18	1069
19	713
20	271
21	1937
22	3223
23	5213
24	751
25	8477
26	4339
27	353
28	1501
29	287
30	829
31	1553
32	2371
33	1811
34	11185
35	3023
36	7381
37	7937
38	6439
39	1433
40	13975
41	2897
42	4183

[1, 3, 7, 23, 31, 47, 199, 83, 61, 257, 139, 953, 991, 647, 1735, 383, 511, 1337, 1069, 713, 271, 1937, 3223, 5213, 751, 8477, 4339, 353, 1501, 287, 829, 1553, 2371, 1811, 11185, 3023, 7381, 7937, 6439, 1433, 13975, 2897, 4183]

cp's OEIS Frontend

A260350 Define g(k) = min(n: n >= 0, 2^n + k prime). Then a(n) = min(odd k: g(k) = n).

Table of values

List of values