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 A113193 #3 Mar 30 2012 17:22:41
%S A113193 1,1,0,1,0,1,1,0,2,2,1,1,1,2,0,1,0,1,3,1,0,2,2,1,3,1,0,1,0,3,3,0,1,2,
%T A113193 1,1,2,1,0,2,1,0,4,2,1,3,0,1,2,1,0,1,0,2,0,1,2,1,3,0,2,1,2,1,0,0,2,3,
%U A113193 0,1,1,3,0,1,0,1,0,0,4,1,1,1,2,1,0,1,0,3,1,1,0,2,4,1,1,0,3,0,0,5,0,1,2,1,0
%N A113193 Number of times that Lucas(n)-Lucas(i) is prime for i=0..n-3.
%C A113193 We exclude i=n-2 and i=n-1 because they yield Lucas(n-2) and Lucas(n-1), respectively. Sequence A113194 lists the n for which a(n)=0.
%t A113193 Lucas[n_] := Fibonacci[n+1]+Fibonacci[n-1]; Table[cnt=0; Do[If[PrimeQ[Lucas[n]-Lucas[i]], cnt++ ], {i, 0, n-3}]; cnt, {n, 3, 150}]
%Y A113193 Cf. A113192 (primes that are the difference of two Lucas numbers).
%K A113193 nonn
%O A113193 3,9
%A A113193 _T. D. Noe_, Oct 17 2005