A079669 - cp's OEIS frontend

A079669 a(n) = least k such that the distance from Fibonacci(k) to the closest prime is n, or -1 if no such k exists.

n	a(n)
0	3
1	1
2	0
3	9
4	16
5	12
6	37
7	42
8	149
9	33
10	26
11	27
12	38
13	24
14	28
15	189
16	44
17	111
18	50
19	66
20	49
21	57
22	68
23	30
24	46
25	81
26	142
27	78
28	92
29	96
30	59
31	69
32	71
33	141
34	184
35	267
36	67
37	129
38	61
39	117
40	211
41	576
42	115
43	372
44	161
45	138
46	119
47	198

[3, 1, 0, 9, 16, 12, 37, 42, 149, 33, 26, 27, 38, 24, 28, 189, 44, 111, 50, 66, 49, 57, 68, 30, 46, 81, 142, 78, 92, 96, 59, 69, 71, 141, 184, 267, 67, 129, 61, 117, 211, 576, 115, 372, 161, 138, 119, 198]

cp's OEIS Frontend

A079669 a(n) = least k such that the distance from Fibonacci(k) to the closest prime is n, or -1 if no such k exists.

Table of values

List of values

n	a(n)
0	3
1	1
2	0
3	9
4	16
5	12
6	37
7	42
8	149
9	33
10	26
11	27
12	38
13	24
14	28
15	189
16	44
17	111
18	50
19	66
20	49
21	57
22	68
23	30
24	46
25	81
26	142
27	78
28	92
29	96
30	59
31	69
32	71
33	141
34	184
35	267
36	67
37	129
38	61
39	117
40	211
41	576
42	115
43	372
44	161
45	138
46	119
47	198

n	a(n)
0	3
1	1
2	0
3	9
4	16
5	12
6	37
7	42
8	149
9	33
10	26
11	27
12	38
13	24
14	28
15	189
16	44
17	111
18	50
19	66
20	49
21	57
22	68
23	30
24	46
25	81
26	142
27	78
28	92
29	96
30	59
31	69
32	71
33	141
34	184
35	267
36	67
37	129
38	61
39	117
40	211
41	576
42	115
43	372
44	161
45	138
46	119
47	198

n	a(n)
0	3
1	1
2	0
3	9
4	16
5	12
6	37
7	42
8	149
9	33
10	26
11	27
12	38
13	24
14	28
15	189
16	44
17	111
18	50
19	66
20	49
21	57
22	68
23	30
24	46
25	81
26	142
27	78
28	92
29	96
30	59
31	69
32	71
33	141
34	184
35	267
36	67
37	129
38	61
39	117
40	211
41	576
42	115
43	372
44	161
45	138
46	119
47	198