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!)
A217671 a(n) is the least prime of the set of the smallest n consecutive primes a(n)=q_1(n), q_2(n),..., such that between (1/2)*q_i and (1/2)q_(i+1), i=1,...,n-1, there exists a prime, or a(n)=0 if no such set of primes exists. 1
3, 3, 3, 73, 523, 6581, 10753, 43103, 43103, 43103, 55457, 55457, 28751773, 278689963, 278689963, 784284211, 4440915607, 8340839629, 30651695947, 50246427391, 50246427391 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
COMMENTS
If a(N) = 0, then a(n) = 0 for n > N. Conjecture 39 in the Shevelev link says that a(n) > 0.
LINKS
V. Shevelev, Ramanujan and Labos primes, their generalizations, and classifications of primes, J. Integer Seq. 15 (2012) Article 12.5.4
CROSSREFS
Sequence in context: A340821 A091323 A174641 * A118539 A015665 A343120
KEYWORD
nonn
AUTHOR
Vladimir Shevelev, Oct 10 2012
EXTENSIONS
a(15)-a(17) from Carlos Rivera and Hans Havermann
a(18)-a(20) from Hans Havermann
a(21)-a(22) from Donovan Johnson, Oct 17 2012
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 April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)