login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A058188 Number of primes between prime(n) and prime(n) + sqrt(prime(n)), where prime(n) is the n-th prime. 3
1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 2, 2, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 3, 3, 2, 1, 0, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 1, 1, 3, 4, 3, 2, 2, 1, 2, 3, 3, 4, 3, 3, 2, 1, 1, 3, 2, 1, 1, 3, 3, 3, 3, 2, 2, 3, 3, 3, 3, 2, 2, 3, 2, 4, 3, 4, 3, 3, 4, 4, 3, 3, 2, 2, 3, 4, 3, 3, 3, 2, 2, 1, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,12

COMMENTS

Conjecture: if prime(n)>=127, there is always at least one prime between prime(n) and prime(n) + sqrt(prime(n)). Easily checked for prime(n)<1.1e15 in existing maximal gap tables

REFERENCES

R. K. Guy: Unsolved problems in number theory, 2nd ed., Springer-Verlag,1994; Sections A8, A 9.

Paulo Ribenboim: The little book of big primes, Springer-Verlag,1991; 142ff

LINKS

T. D. Noe, Table of n, a(n) for n = 1..10000

EXAMPLE

a(12) = 2 because between p(12)= 37 and 37+sqrt(37) = 43.08 there are two primes: 41 and 43

PROG

(PARI) a(n) = my(p=prime(n)); primepi(p+sqrtint(p)) - n; \\ Michel Marcus, Jun 21 2017

CROSSREFS

Cf. A030296.

Sequence in context: A305195 A073772 A164562 * A333851 A335230 A300752

Adjacent sequences:  A058185 A058186 A058187 * A058189 A058190 A058191

KEYWORD

nonn

AUTHOR

Adam Kertesz, Dec 04 2000

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 19 07:23 EDT 2021. Contains 348074 sequences. (Running on oeis4.)