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 A364459 #14 Aug 30 2023 14:13:55 %S A364459 0,1,1,1,2,1,1,1,2,2,2,2,3,2,2,3,3,2,2,1,2,3,3,2,2,2,3,3,3,3,3,3,3,3, %T A364459 4,4,4,3,3,4,4,3,3,2,3,3,4,3,3,3,3,4,4,3,4,4,5,5,5,4,4,4,4,4,4,5,5,4, %U A364459 4,4,5,4,4,3,3,3,3,3,4,3,3,4,4,4,4,4,4,5,6,5,5,5,6,6,6,6,6,5,5,5 %N A364459 Number of primes in the interval [n,n+log(n)^2]. %C A364459 On average, there are log(n) primes in the interval [n,n+log(n)^2] for any number n. %H A364459 Robert Israel, <a href="/A364459/b364459.txt">Table of n, a(n) for n = 1..10000</a> %p A364459 a:= n-> add(`if`(isprime(i), 1, 0), i=n..floor(n+log(n)^2)): %p A364459 seq(a(n), n=1..100); # _Alois P. Heinz_, Jul 25 2023 %o A364459 (PARI) for(n=2, 100, An=primepi(n+(log(n))^2)-primepi(n-1); print1(An,", ")) %Y A364459 Cf. A000040, A000720, A120936. %K A364459 nonn %O A364459 1,5 %A A364459 _Alain Rocchelli_, Jul 25 2023