|
Search: id:A099802
|
|
| |
|
| 1, 2, 3, 4, 4, 5, 6, 6, 7, 8, 8, 9, 9, 9, 10, 11, 11, 11, 12, 12, 13, 14, 14, 15, 15, 15, 16, 16, 16, 17, 18, 18, 18, 19, 19, 20, 21, 21, 21, 22, 22, 23, 23, 23, 24, 24, 24, 24, 25, 25, 26, 27, 27, 28, 29, 29, 30, 30, 30, 30, 30, 30, 30, 31, 31, 32, 32, 32, 33, 34, 34, 34, 34, 34
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Maximal number of primes possible in a string of 2n consecutive numbers. - Lekraj Beedassy (blekraj(AT)yahoo.com), Dec 04 2004
a(n) = A139325(n,1) + 1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 14 2008
Or the number of primes<=2*n. [From Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Oct 29 2009]
|
|
MAPLE
|
with(numtheory):seq(pi(2*n), n=1..86); (Deutsch)
|
|
PROGRAM
|
(Other) sage: [prime_pi(2*n) for n in xrange(1, 75)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 06 2009]
|
|
CROSSREFS
|
Sequence in context: A080444 A082288 A099801 this_sequence A112232 A039708 A094500
Adjacent sequences: A099799 A099800 A099801 this_sequence A099803 A099804 A099805
|
|
KEYWORD
|
nonn,easy,new
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Nov 19 2004
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 12 2005
|
|
|
Search completed in 0.002 seconds
|
