The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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.
LINKS
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 3 12:27 EDT 2024. Contains 373060 sequences. (Running on oeis4.)