A113189 - OEIS

%I #3 Mar 30 2012 17:22:41

%S 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,

%T 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,

%U 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

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

%C 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.

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

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

%K nonn

%O 3,2

%A _T. D. Noe_, Oct 17 2005