cp's OEIS Frontend

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.

A076044 Largest a(n) values with at most n primes between a(n) and a(n)+sqrt(a(n)) inclusive.

Original entry on oeis.org

116, 1330, 2481, 2558, 5929, 7371, 9961, 10743, 23378, 35608, 35612, 38361, 44286, 46902, 69503, 69545, 88024, 107359, 110087, 110099, 113386, 126860, 250172, 250180, 250186, 250202, 267969, 267975, 285846, 285858, 302013, 302017, 360346, 369213, 404562, 404574, 484650, 484654, 514893, 561443, 561481, 561509, 561533, 638194, 638208, 650020, 682490, 713634, 713636
Offset: 0

Views

Author

Adam Kertesz, Oct 28 2002

Keywords

Comments

Conjecture: for every m greater than a(n), there are more than n primes between m and m+sqrt(m); true if a(n) less than 1000000.

Examples

			a(3)=2558 because there are three primes between 2558 and int(2558+sqrt 2558)= 2608 and for every larger number there are more than 3 primes in the respective interval.
		

References

  • P. Ribenboim, The Little Book of Big Primes, Springer-Verlag, 1991, p. 143