This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A079669 #8 Jan 29 2022 13:26:13 %S A079669 3,1,0,9,16,12,37,42,149,33,26,27,38,24,28,189,44,111,50,66,49,57,68, %T A079669 30,46,81,142,78,92,96,59,69,71,141,184,267,67,129,61,117,211,576,115, %U A079669 372,161,138,119,198 %N 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. %o A079669 (PARI) a(n)=if(n<0,0,s=1; while(abs(n-min(abs(precprime(fibonacci(s))-fibonacci(s)),abs(nextprime(fibonacci(s))-fibonacci(s))))>0,s++); s) %Y A079669 Cf. A051699, A000045. %K A079669 nonn %O A079669 0,1 %A A079669 _Benoit Cloitre_, Jan 26 2003 %E A079669 Changed "was found" to "exists" in definition. Offset was wrong. Adjusted initial terms. - _N. J. A. Sloane_, Jan 29 2022