cp's OEIS Frontend

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.

A098398 Number of primes that are not less than prime(n)-Log2(Log2(prime(n))) and not greater than prime(n)+Log2(Log2(prime(n))), where Log2=A000523.

This page as a plain text file.
%I A098398 #3 Mar 30 2012 18:50:45
%S A098398 1,1,1,1,1,1,2,2,1,2,2,1,2,2,1,1,2,2,1,2,2,1,1,1,1,2,2,2,2,1,1,1,2,2,
%T A098398 2,2,1,1,1,1,2,2,2,2,2,2,1,1,2,2,1,2,2,1,1,1,2,2,1,2,2,1,1,2,2,1,1,1,
%U A098398 2,2,1,1,1,1,1,1,1,1,1,1,2,2,2,2,1,1,1,1,2,2,1,1,1,1,1,1,1,2,2,1,1,1,1,2,2
%N A098398 Number of primes that are not less than prime(n)-Log2(Log2(prime(n))) and not greater than prime(n)+Log2(Log2(prime(n))), where Log2=A000523.
%C A098398 a(n) = A000720(A098392(n)) - A000720(A098393(n)-1);
%C A098398 a(n) <= A098396(n) <= A098397(n) <= A097935(n);
%C A098398 a(n)<=2 for n<=6543; a(6544)=#{2^16+1=65537,65539,65543}=3.
%e A098398 a(10) = #{p prime: A098392(10) <= p <= A098393(10)} =
%e A098398 = #{p prime: 27 <= p <= 31} = #{29,31} = 2.
%K A098398 nonn
%O A098398 1,7
%A A098398 _Reinhard Zumkeller_, Sep 06 2004