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 A354841 #17 Jun 27 2022 10:02:56 %S A354841 0,0,0,1,0,1,0,0,1,1,1,1,0,0,1,1,1,1,0,0,1,1,0,0,0,1,1,2,1,1,0,0,0,1, %T A354841 1,1,0,1,1,2,1,1,0,1,1,1,0,0,0,1,1,1,0,0,1,1,2,2,1,1,0,0,1,1,1,1,1,1, %U A354841 2,2,1,1,0,0,1,1,1,1,1,1,1,1,0,0,1,1,1 %N A354841 Number of primes between n and n+log(n), exclusive. %C A354841 Inspired by A275235. %t A354841 a[n_] := Count[Range[n + 1, n + Log[n]], _?PrimeQ]; Array[a, 100] (* _Amiram Eldar_, Jun 08 2022 *) %o A354841 (PARI) a(n) = primepi(n+log(n)) - primepi(n); \\ _Michel Marcus_, Jun 25 2022 %Y A354841 Cf. A275235 (similar, but with n+log(n)^2), A354842. %K A354841 nonn %O A354841 1,28 %A A354841 _Bernard Schott_, Jun 08 2022