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

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.

Terms

    a(0) =3a(1) =1a(2) =0a(3) =9a(4) =16a(5) =12a(6) =37a(7) =42a(8) =149a(9) =33a(10) =26a(11) =27a(12) =38a(13) =24a(14) =28a(15) =189a(16) =44a(17) =111a(18) =50a(19) =66a(20) =49a(21) =57a(22) =68a(23) =30a(24) =46a(25) =81a(26) =142a(27) =78a(28) =92a(29) =96

External references