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.

A120936 Number of primes in the interval [n,n+log(n)].

This page as a plain text file.
%I A120936 #10 Apr 17 2012 00:06:24
%S A120936 0,1,1,1,1,1,1,0,1,1,2,1,1,0,1,1,2,1,1,0,1,1,1,0,0,1,1,2,2,1,1,0,0,1,
%T A120936 1,1,1,1,1,2,2,1,1,1,1,1,1,0,0,1,1,1,1,0,1,1,2,2,2,1,1,0,1,1,1,1,2,1,
%U A120936 2,2,2,1,1,0,1,1,1,1,2,1,1,1,1,0,1,1,1,1,1,0,0,0,1,1,1,1,2,1,2,2,2,1,2,1,2
%N A120936 Number of primes in the interval [n,n+log(n)].
%C A120936 Soundararajan states that, on average, there is one prime in the interval [n,n+log(n)] for any number n. See A120934 for the prime n that yield new records.
%H A120936 T. D. Noe, <a href="/A120936/b120936.txt">Table of n, a(n) for n = 1..5000</a>
%H A120936 K. Soundararajan, <a href="http://www.arXiv.org/abs/math.NT/0606408">The distribution of prime numbers</a>
%t A120936 Table[Length[Select[Range[n,n+Log[n]],PrimeQ]], {n,150}]
%o A120936 (PARI) a(n)=sum(k=n,n+log(n),isprime(k)) \\ _Charles R Greathouse IV_, Apr 17 2012
%Y A120936 Cf. A008407, A020497.
%K A120936 nonn
%O A120936 1,11
%A A120936 _T. D. Noe_, Jul 21 2006