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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A060769 "Overdue" primes: upper ends of prime gaps that are larger than the prime number theorem predicts. 5
 29, 37, 53, 59, 67, 79, 89, 97, 127, 149, 191, 211, 223, 251, 293, 307, 331, 347, 367, 397, 409, 419, 431, 457, 479, 487, 499, 521, 541, 557, 587, 631, 641, 673, 691, 701, 709, 719, 727, 751, 769 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Harry J. Smith, Table of n, a(n) for n = 1..1000 FORMULA A prime p belongs to the sequence iff p/log(p) - q/log(q) > 1 where q is the preceding prime. EXAMPLE 79 is in the sequence because 79/log(79) - 73/log(73) = 1.065... > 1. PROG (PARI) { default(realprecision, 100); n=0; s=2/log(2); forprime (p=3, 26203, if ((r=p/log(p)) - s > 1, write("b060769.txt", n++, " ", p); ); s=r; ) } \\ Harry J. Smith, Jul 11 2009 CROSSREFS Cf. A060770, A060771. Apart from 2 this is the complementary prime set to A060770. Sequence in context: A177873 A234973 A134100 * A031925 A325058 A107134 Adjacent sequences:  A060766 A060767 A060768 * A060770 A060771 A060772 KEYWORD nonn AUTHOR Ulrich Schimke (ulrschimke(AT)aol.com) 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.

Last modified December 1 04:02 EST 2021. Contains 349426 sequences. (Running on oeis4.)