login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A099381
Numbers n such that |Fibonacci(n) - prime(n)| is prime.
2
2, 3, 6, 8, 9, 12, 15, 24, 33, 48, 225, 525, 948, 1344, 5169, 30600, 32520, 32604, 72396
OFFSET
1,1
COMMENTS
Fibonacci(n) - prime(n) > 0 for n >= 8. All terms other than 2 and 8 (only two terms producing 2, the only even prime) are divisible by 3 (as Fibonacci(n) is even - and hence |Fibonacci(n) - prime(n)| > 1 and odd - iff n is divisible by 3).
Some of the larger entries may only correspond to probable primes.
EXAMPLE
9 is a term as Fibonacci(9) - prime(9) = 34 - 23 = 11, a prime.
MATHEMATICA
fQ[n_] := PrimeQ[ Fibonacci[n] - Prime[n]]; Do[ If[ fQ[n], Print[n]], {n, 9, 10^4, 3}] (* Robert G. Wilson v, Nov 18 2004 *)
PROG
(PARI) print1(2, ", ", 3, ", ", 6, ", ", 8, ", "); forstep(n=9, 5169, 3, if(isprime(fibonacci(n)-prime(n)), print1(n, ", ")))
CROSSREFS
Cf. A050180 (Fibonacci(n) + prime(n) is prime).
Sequence in context: A287659 A047244 A111215 * A289943 A089437 A146768
KEYWORD
nonn
AUTHOR
Rick L. Shepherd, Nov 16 2004
EXTENSIONS
4 more terms from Jason Earls, Nov 25 2007
STATUS
approved