This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A179240 a(n) is the smallest prime q > a(n-1) such that, for the previous prime p and the following prime r, the fraction (q-p)/(r-q) has denominator equal to A006843(n) (or 0, if such a prime does not exist). 3
 5, 11, 17, 19, 29, 41, 47, 67, 73, 97, 101, 359, 367, 379, 383, 389, 397, 419, 421, 449, 467, 547, 613, 631, 647, 683, 691, 733, 769, 797, 811, 929, 941, 1021, 1087, 1153, 1181, 1193, 1249, 1709, 1721, 1747, 1847, 1889, 2017, 2153, 2357 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Conjecture: a(n) > 0 for all n. LINKS EXAMPLE For n = 1..3, A006843(n) = 1, and p,q,r have to obey the condition r-q | q-p. Thus a(1) = 5, a(2) = 11, a(3) = 17. CROSSREFS Cf. A006843, A168253, A179210, A179234, A179256, A001223 Sequence in context: A239709 A175249 A271982 * A176905 A084088 A314183 Adjacent sequences:  A179237 A179238 A179239 * A179241 A179242 A179243 KEYWORD nonn AUTHOR Vladimir Shevelev, Jan 06 2011 EXTENSIONS More terms from Alois P. Heinz, Jan 06 2011 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 13 22:55 EST 2019. Contains 329974 sequences. (Running on oeis4.)