|
Search: id:A062298
|
|
|
| A062298 |
|
Number of nonprimes <= n. |
|
+0
17
|
|
| 1, 1, 1, 2, 2, 3, 3, 4, 5, 6, 6, 7, 7, 8, 9, 10, 10, 11, 11, 12, 13, 14, 14, 15, 16, 17, 18, 19, 19, 20, 20, 21, 22, 23, 24, 25, 25, 26, 27, 28, 28, 29, 29, 30, 31, 32, 32, 33, 34, 35, 36, 37, 37, 38, 39, 40, 41, 42, 42, 43, 43, 44, 45, 46, 47, 48, 48, 49, 50, 51, 51, 52, 52, 53
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
a(n) = n - A000720(n). This is asymptotic to n - Li(n). Note that A062298(n) + A095117(n) = 2*n. - Jonathan Vos Post (jvospost3(AT)gmail.com), Nov 22 2004
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
EXAMPLE
|
a(19) = 11 as there are 8 primes up to 19 (inclusive).
|
|
MAPLE
|
NumComposites := proc(N::posint) local count, i:count := 0:for i from 1 to N do if not isprime(i) then count := count + 1 fi:od: count; end:seq(NumComposites(binomial(k+1, k)), k=0..73); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 26 2008
A062298 := proc(n) n-numtheory[pi](n) ; end: seq(A062298(n), n=1..120) ; [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 27 2009]
|
|
PROGRAM
|
(PARI) { for (n=1, 1000, write("b062298.txt", n, " ", n-primepi(n)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 04 2009]
|
|
CROSSREFS
|
a(n)=n-A000720(n).
Sequence in context: A030585 A030565 A072509 this_sequence A116579 A156253 A060151
Adjacent sequences: A062295 A062296 A062297 this_sequence A062299 A062300 A062301
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 19 2001
|
|
EXTENSIONS
|
Corrected and extended by Vladeta Jovovic (vladeta(AT)eunet.rs), Jun 22 2001
|
|
|
Search completed in 0.002 seconds
|
