|
Search: id:A095924
|
|
|
| A095924 |
|
a(n) is the smallest prime of earlier set of n consecutive good primes version 1 (see A046869). |
|
+0
2
|
|
| 5, 37, 211, 251, 32467, 96377, 96377, 5647409, 12285587, 202924901, 3916407479
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
Puzzle 273 of The Prime puzzles & Problem connection (www.primepuzzles.net).
|
|
LINKS
|
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: A006468 A144954 A146195 this_sequence A088582 A088583 A015548
Adjacent sequences: A095921 A095922 A095923 this_sequence A095925 A095926 A095927
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Enoch Haga and Farideh Firoozbakht (Enokh(AT)comcast.net--mymontain(AT)yahoo.com), Jul 12 2004
|
|
|
Search completed in 0.002 seconds
|
