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!)
A095924 a(n) is the smallest prime of earlier set of n consecutive good primes version 1 (see A046869). 1
5, 37, 211, 251, 32467, 96377, 96377, 5647409, 12285587, 202924901, 3916407479 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

REFERENCES

Puzzle 273 of The Prime puzzles & Problem connection (www.primepuzzles.net).

LINKS

Table of n, a(n) for n=1..11.

Carlos. Rivera Consecutive 'good' primes

EXAMPLE

A good prime (version 1) is a prime p=prime(n) such that prime(n)^2 > prime(n-1)*prime(n+1), so 5 is a good prime because 5=prime(3); prime(2)=3; prime(4)=7 & 5^2 > 3*7.

a(11)=3916407479 because the 11 consecutive primes 3916407479, 3916407527, 3916407569, 3916407611, 3916407653, 3916407679, 3916407697, 3916407713, 3916407727, 3916407739 & 3916407751 are good primes and 3916407479 is the smallest prime with this property.

CROSSREFS

Cf. A046869, A028388, A096473.

Sequence in context: A270931 A241629 A273539 * A270019 A179567 A339386

Adjacent sequences:  A095921 A095922 A095923 * A095925 A095926 A095927

KEYWORD

more,nonn

AUTHOR

Enoch Haga and Farideh Firoozbakht, Jul 12 2004

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 April 10 18:17 EDT 2021. Contains 342853 sequences. (Running on oeis4.)