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 A189026 #10 Mar 24 2017 00:47:53 %S A189026 127,1367,2531,2539,6007,7457,10061,10847,23531,35797,35801,38557, %T A189026 44497,47111,69767,69809,88321,107687,110419,110431,113723,127217, %U A189026 250673,250681,250687,250703,268487,268493,286381,286393,302563,302567,360947,369821,405199 %N A189026 There appear to be at least n primes in the range (x-sqrt(x), x] for all x >= a(n). %C A189026 These terms exist only if a strong form of Oppermann's conjecture that for any k>1 there is a prime between k^2-k and k^2 is true. Note that every term is prime. Sequence A189024 gives the number of primes in the range (x-sqrt(x), x]. The index of the prime a(n), that is, primepi(a(n)), is approximately (2.4*n)^2. These primes are generated in a manner similar to the Ramanujan primes (A104272). %H A189026 T. D. Noe, <a href="/A189026/b189026.txt">Table of n, a(n) for n = 1..1000</a> %H A189026 Wikipedia, <a href="http://en.wikipedia.org/wiki/Oppermann's_conjecture">Oppermann's conjecture</a> %Y A189026 Cf. A189025, A189027. %K A189026 nonn %O A189026 1,1 %A A189026 _T. D. Noe_, Apr 15 2011