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 A366134 #6 Oct 23 2023 01:44:39
%S A366134 1,1,1,0,1,1,1,1,1,1,1,2,2,1,1,1,2,1,2,2,1,1,1,1,2,3,2,2,1,0,1,2,1,0,
%T A366134 2,1,2,2,1,2,1,1,3,2,1,0,0,3,2,2,2,1,1,1,1,2,2,2,2,1,1,0,3,2,1,0,1,1,
%U A366134 2,2,1,1,1,2,2,1,1,1,1,2,2,2,3,2,2,1,2,3,2,1,1,2,2,2,2
%N A366134 Number of primes between prime(n) and prime(n)+2*log(prime(n)), exclusive.
%C A366134 Inspired by A365573.
%F A366134 Conjecture: Limit_{N->oo} (Ratio_{n=1..N} a(n)=0) = 1/e^2 (A092553).
%t A366134 a[n_]:=PrimePi[Prime[n]+2Log[Prime[n]]]-PrimePi[Prime[n]]; Array[a,95] (* _Stefano Spezia_, Sep 30 2023 *)
%o A366134 (PARI) a(n) = primepi(prime(n)+2*log(prime(n))) - primepi(prime(n))
%Y A366134 Cf. A365573, A354841, A092553.
%K A366134 nonn
%O A366134 1,12
%A A366134 _Alain Rocchelli_, Sep 30 2023