|
Search: id:A035250
|
|
|
| A035250 |
|
Number of primes between n and 2n (inclusive). |
|
+0
11
|
|
| 1, 2, 2, 2, 2, 2, 3, 2, 3, 4, 4, 4, 4, 3, 4, 5, 5, 4, 5, 4, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 8, 7, 7, 8, 8, 9, 10, 9, 9, 10, 10, 10, 10, 9, 10, 10, 10, 9, 10, 10, 11, 12, 12, 12, 13, 13, 14, 14, 14, 13, 13, 12, 12, 13, 13, 14, 14, 13, 14, 15, 15, 14, 14, 13, 14, 15, 15, 15, 16, 15, 15, 16, 16
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
By Bertrand's Postulate (proved by Chebyshev), there is always a prime between n and 2n, i.e. a(n) is positive for all n.
The smallest and largest primes between n and 2n inclusive are A007918 and A060308 respectively. - Lekraj Beedassy (blekraj(AT)yahoo.com), Jan 01 2007
|
|
REFERENCES
|
Aigner, M. and Ziegler, G. Proofs from The Book (2nd edition). Springer-Verlag, 2001.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
International Mathematics Olympiad, Proof of Bertrand's Postulate
|
|
EXAMPLE
|
The primes between n = 13 and 2n = 26, inclusive, are 13, 17, 19, 23; so a(13) = 4.
|
|
CROSSREFS
|
Sequence in context: A120676 A125973 A001031 this_sequence A165054 A067743 A029230
Adjacent sequences: A035247 A035248 A035249 this_sequence A035251 A035252 A035253
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Erich Friedman (erich.friedman(AT)stetson.edu)
|
|
|
Search completed in 0.002 seconds
|
