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 A361510 #14 Apr 01 2023 23:22:15
%S A361510 3,1,1,0,0,0,4,0,3,4,9,0,5,0,3,4,9,0,16,24,18,4,3,0,7,12
%N A361510 a(n) = smallest k >= 0 such that Fibonacci(k) + Fibonacci(n) is a prime, or -1 if no such k exists.
%C A361510 a(26) is currently unknown.
%F A361510 a(n) = A361902(A000045(n)). - _Pontus von Brömssen_, Mar 30 2023
%p A361510 See A361509.
%t A361510 a[n_] := Module[{fn = Fibonacci[n], k = 0}, While[! PrimeQ[fn + Fibonacci[k]], k++]; k]; Array[a, 26, 0] (* _Amiram Eldar_, Mar 30 2023 *)
%o A361510 (PARI) a(n) = my(k=0, fn=fibonacci(n)); while (!isprime(fn+fibonacci(k)), k++); k; \\ _Michel Marcus_, Mar 30 2023
%Y A361510 Cf. A000045, A361509, A361902.
%K A361510 nonn,more,less
%O A361510 0,1
%A A361510 _Jack Braxton_, Mar 26 2023
%E A361510 Edited by _N. J. A. Sloane_, Mar 30 2023