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 A359145 #16 Feb 07 2023 17:09:56
%S A359145 6,10,27,57,95,148,221,345,539,806,1270,1393,1407,1422,2590,2645,3292,
%T A359145 4888,4930,5374,7406,7442,8511,11578,11653,11671,11765,11774,18997,
%U A359145 19066,19135,19204,19362,19372,30621,31925,31935,31946,31956,47038,47264,55573,64993
%N A359145 a(n) = smallest k such that li(k) - pi(k) >= n, where li(k) is the logarithmic integral and pi(x) is the number of primes <= x.
%C A359145 Suggested by the "Great Prime Number Race", which investigates when li(n) - pi(n) changes sign.
%C A359145 Note this is different from the smallest k such that A052435(k) >= n, because of the rounding in A052435.
%C A359145 Since, by the prime number theorem li(n)/pi(n) converges to 1, this sequence is probably finite.
%D A359145 Roger Plymen, The Great Prime Number Race, AMS, 2020.
%H A359145 Patrick Demichel, <a href="http://web.archive.org/web/20060908033007/http://demichel.net/patrick/li_crossover_pi.pdf">The prime counting function and related subjects</a>, April 05, 2005, 75 pages.
%t A359145 seq[len_, kmax_] := Module[{s = Table[0, {len}], c = 0, k = 1, d}, While[c < len && k <= kmax, d = Floor[LogIntegral[k] - PrimePi[k]]; If[d > 0 && d <= len && s[[d]] == 0, Do[If[s[[i]] == 0, s[[i]] = k; c++], {i, 1, d}]]; k++]; s]; seq[50, 10^6] (* _Amiram Eldar_, Feb 07 2023 *)
%Y A359145 Cf. A000720, A052435, A282870.
%K A359145 nonn
%O A359145 1,1
%A A359145 _N. J. A. Sloane_, Feb 06 2023
%E A359145 More terms from _Amiram Eldar_, Feb 07 2023