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 A354840 #34 Jun 29 2022 04:55:55
%S A354840 1,4,9,16,35,57,93,222,427,819,1257,1270,1276,2651,5806,13673,19366,
%T A354840 19372,27723,108857,113036,113038,115748,524856,560074,1006146,
%U A354840 1219767,1652728,2704892,2704894,8756936,21401949,21401979,40268383,40268435,40268437,167540089,167540101
%N A354840 a(n) is the smallest number k such that A275235(k) = n.
%C A354840 Equivalently, the smallest integer k such that the number of primes between k and k+log(k)^2, exclusive, is n.
%C A354840 Up to a(37) = 167540101, the last known term, this sequence is monotonic.
%D A354840 Richard K. Guy, Unsolved Problems in Number Theory, 3rd Edition, Springer, 2004, Section A2, Primes connected with factorials, p. 11.
%e A354840 In the interval ]9; 9+log(9)^2[ = ]9; 13.827...[, there are two primes 11 and 13 and this is the first such interval with two primes, hence a(2) = 9.
%t A354840 f[n_] := Count[Range[n + 1, n + Log[n]^2], _?PrimeQ]; seq[len_, max_] := Module[{s = Table[0, {len}], c = 0, n = 1, i}, While[c < len && n < max, i = f[n] + 1; If[i <= len && s[[i]] == 0, c++; s[[i]] = n]; n++]; s]; seq[15, 10^4] (* _Amiram Eldar_, Jun 08 2022 *)
%Y A354840 Cf. A275235, A354842 (similar, but between k and k+log(k)).
%K A354840 nonn
%O A354840 0,2
%A A354840 _Bernard Schott_, Jun 08 2022
%E A354840 More terms from _Amiram Eldar_, Jun 08 2022