The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A179479 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 2, for odd n and 1 for even n (or 0, if such a prime does not exist). 0
3, 5, 7, 11, 13, 17, 19, 29, 43, 53, 67, 71, 79, 97 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Conjecture: a(n) > 0 for all n.
Since, as it is accepted in the OEIS, we consider the uncancelled fractions, then, by the condition, for even n, we have (r-q)|(q-p).
LINKS
EXAMPLE
If n=1, then denominator should be 2. Thus a(1)=3, since (3-2)/(5-3)=1/2. If n=2, then denominator should be 1. Thus a(2)=5, since (5-3)/(7-5)=1/1, etc.
CROSSREFS
Sequence in context: A212376 A059264 A216484 * A038604 A155026 A295705
KEYWORD
nonn
AUTHOR
Vladimir Shevelev, Jan 08 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 17 08:10 EDT 2024. Contains 372579 sequences. (Running on oeis4.)