This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A113189 #3 Mar 30 2012 17:22:41
%S A113189 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 A113189 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 A113189 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 A113189 Number of times that Fibonacci(n)-Fibonacci(i) is prime for i=0..n-3.
%C A113189 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 A113189 Table[cnt=0; Do[If[PrimeQ[Fibonacci[n]-Fibonacci[i]], cnt++ ], {i, 0, n-3}]; cnt, {n, 3, 150}]
%Y A113189 Cf. A113188 (primes that are the difference of two Fibonacci numbers).
%K A113189 nonn
%O A113189 3,2
%A A113189 _T. D. Noe_, Oct 17 2005