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 A182487 #10 Jul 29 2015 19:05:46
%S A182487 3,4,4,6,4,6,6,14,10,10,6,6,8,18,12,24,16,10,6,12,30,12,24,42,30,24,
%T A182487 60,24,30,34,30,36,46,12,36,18,34,24,24,30,36,52,72,16,22,48,44,50,34,
%U A182487 20,20,28,44,50,40,92,60,86,16,52,48,66,46,168,50,174,36
%N A182487 Nextprime(F(n)) - prevprime(F(n)), where F(n) is the n-th Fibonacci number.
%C A182487 Smallest prime following Fibonacci(n) minus largest prime immediately preceding Fibonacci(n). Starting from Fibonacci(4), because for n<4 there is no prime preceding Fibonacci(n).
%H A182487 Alois P. Heinz, <a href="/A182487/b182487.txt">Table of n, a(n) for n = 4..1000</a>
%F A182487 a(n) = A014208(n+4) - A180422(n).
%e A182487 a(0) = A014208(4) - A180422(0) = 5 - 2 = 3,
%e A182487 a(7) = A014208(11) - A180422(7) = 97-83 = 14.
%p A182487 a:= n-> (f-> nextprime(f)-prevprime(f))(combinat[fibonacci](n)):
%p A182487 seq(a(n), n=4..100); # _Alois P. Heinz_, Jul 29 2015
%t A182487 Table[f = Fibonacci[n]; NextPrime[f] - NextPrime[f, -1], {n, 4, 100}] (* _T. D. Noe_, May 02 2012 *)
%Y A182487 Cf. A014208, A180422, A013633, A058043, A058054, A161503.
%Y A182487 Cf. A079677 (distance from F(n) to the nearest prime).
%K A182487 nonn,easy
%O A182487 4,1
%A A182487 _Alex Ratushnyak_, May 02 2012