|
Search: id:A092998
|
|
|
| A092998 |
|
Least integer k > n such that the number of primes between 1 and n (exclusive) is the same as the number of primes between n and k (exclusive). |
|
+0
4
|
|
| 3, 6, 8, 12, 14, 18, 20, 20, 20, 24, 30, 32, 38, 38, 38, 42, 44, 48, 54, 54, 54, 60, 62, 62, 62, 62, 62, 68, 72, 74, 80, 80, 80, 80, 80, 84, 90, 90, 90, 98, 102, 104, 108, 108, 108, 110, 114, 114, 114, 114, 114, 128, 132, 132, 132, 132, 132, 138, 140, 150, 152, 152
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
MATHEMATICA
|
Do[k = n + 1; While[Length[Select[Range[n - 1], PrimeQ]] != Length[Select[Range[n + 1, k - 1], PrimeQ]], k++ ]; Print[k], {n, 2, 100}] - Ryan Propper (rpropper(AT)stanford.edu), Sep 23 2006
|
|
CROSSREFS
|
Cf. A092996, A092997, A077154.
Sequence in context: A070528 A122116 A126862 this_sequence A135731 A118335 A077024
Adjacent sequences: A092995 A092996 A092997 this_sequence A092999 A093000 A093001
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 29 2004
|
|
EXTENSIONS
|
More terms from Ryan Propper (rpropper(AT)stanford.edu), Sep 23 2006
|
|
|
Search completed in 0.002 seconds
|
