A361510 a(n) = smallest k >= 0 such that Fibonacci(k) + Fibonacci(n) is a prime, or -1 if no such k exists.

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

Offset

0,1

Comments

a(26) is currently unknown.

Links

Table of n, a(n) for n=0..25.

Formula

a(n) = A361902(A000045(n)). - Pontus von Brömssen, Mar 30 2023

Maple

See A361509.

Mathematica

a[n_] := Module[{fn = Fibonacci[n], k = 0}, While[! PrimeQ[fn + Fibonacci[k]], k++]; k]; Array[a, 26, 0] (* Amiram Eldar, Mar 30 2023 *)

Prog

(PARI) a(n) = my(k=0, fn=fibonacci(n)); while (!isprime(fn+fibonacci(k)), k++); k; \\ Michel Marcus, Mar 30 2023

Crossrefs

Cf. A000045, A361509, A361902.

Sequence in context: A339632 A350879 A115718 * A204181 A204242 A211313

Adjacent sequences: A361507 A361508 A361509 * A361511 A361512 A361513

Keyword

nonn,more,less

Author

Jack Braxton, Mar 26 2023

Extensions

Edited by N. J. A. Sloane, Mar 30 2023

Status

approved