A113189 Number of times that Fibonacci(n)-Fibonacci(i) is prime for i=0..n-3.

1, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 0, 2, 1, 2, 3, 1, 1, 2, 0, 3, 3, 1, 0, 1, 1, 1, 0, 0, 2, 2, 0, 2, 5, 1, 0, 2, 0, 1, 0, 2, 0, 2, 0, 2, 2, 3, 1, 1, 2, 2, 0, 1, 1, 2, 2, 3, 7, 0, 0, 1, 0, 0, 1, 0, 1, 2, 2, 2, 1, 2, 1, 2, 1, 1, 0, 1, 0, 4, 0, 2, 6, 2, 2, 3, 0, 2, 1, 1, 0, 3, 0, 0, 6, 1, 0, 2, 5, 2, 0, 0, 1, 4, 2, 2

Offset: 3

Author

T. D. Noe, Oct 17 2005

Keywords

• nonn

Comments

We exclude i=n-2 and i=n-1 because they yield Fibonacci(n-2) and Fibonacci(n-1), respectively. Sequence A113190 lists the n for which a(n)=0.

Crossrefs

Cf. A113188 (primes that are the difference of two Fibonacci numbers).

Programs

Mathematica

Table[cnt=0; Do[If[PrimeQ[Fibonacci[n]-Fibonacci[i]], cnt++ ], {i, 0, n-3}]; cnt, {n, 3, 150}]