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 A275235 #8 Jul 22 2016 22:12:56
%S A275235 0,0,0,1,1,1,0,1,2,2,1,2,2,2,2,3,2,2,1,1,2,3,2,2,2,2,3,3,2,3,2,3,3,3,
%T A275235 4,4,3,3,3,4,3,3,2,2,3,3,3,3,3,3,3,4,3,3,4,4,5,5,4,4,3,4,4,4,4,5,4,4,
%U A275235 4,4,4,4,3,3,3,3,3,3,3,3,3,4,3,4,4,4
%N A275235 Number of primes between n and n+log(n)^2.
%C A275235 According to Schinzel's formulation of Cramer's conjecture, a(n) > 0 for n > 7; see Guy.
%D A275235 R. K. Guy, Unsolved Problems in Number Theory, 3rd ed., Springer, 2004, page 11.
%H A275235 Clark Kimberling, <a href="/A275235/b275235.txt">Table of n, a(n) for n = 1..10000</a>
%F A275235 a(n) ~ log(n). - _Ilya Gutkovskiy_, Jul 22 2016
%t A275235 Table[PrimePi[n + Log[n]^2] - PrimePi[n], {n, 1, 200}]
%o A275235 (PARI) a(n) = primepi(n+log(n)^2) - primepi(n) \\ _Felix Fröhlich_, Jul 21 2016
%Y A275235 Cf. A000040.
%K A275235 nonn,easy
%O A275235 1,9
%A A275235 _Clark Kimberling_, Jul 21 2016