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 A098397 #3 Mar 30 2012 18:50:45
%S A098397 2,2,3,2,2,2,3,3,2,2,2,2,3,3,2,1,2,2,4,3,4,3,3,2,3,4,5,5,4,3,2,3,3,2,
%T A098397 2,3,3,3,3,3,3,2,3,4,4,3,1,3,4,4,4,3,2,2,3,4,4,4,5,3,3,1,3,4,4,3,2,2,
%U A098397 3,3,4,3,3,3,3,3,3,3,3,2,2,2,3,3,4,3,3,4,4,4,3,2,3,3,3,3,2,2,2,2,2,2,4,4,4
%N A098397 Number of primes that are not less than prime(n)-Log2(prime(n)) and not greater than prime(n)+Log2(prime(n)), where Log2=A000523.
%C A098397 a(n) = A000720(A098389(n)) - A000720(A098390(n)-1);
%C A098397 A098398(n) <= A098396(n) <= a(n) <= A097935(n).
%e A098397 a(10) = #{p prime: A098389(10) <= p <= A098390(10)} =
%e A098397 = #{p prime: 25 <= p <= 33} = #{29,31} = 2.
%K A098397 nonn
%O A098397 1,1
%A A098397 _Reinhard Zumkeller_, Sep 06 2004