|
Search: id:A072613
|
|
|
| A072613 |
|
Number of numbers of the form p*q (p, q distinct primes) less than or equal to n. |
|
+0
3
|
|
| 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 8, 9, 10, 10, 10, 11, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 16, 17, 17, 17, 17, 18, 18, 18, 19, 19, 19, 19, 20, 20, 20, 20, 20, 21, 21, 21, 22, 22, 22, 22
(list; graph; listen)
|
|
|
OFFSET
|
1,10
|
|
|
COMMENT
|
There was an old comment here that said a(n) was equal to A070548(n) - 1, but this is false (e.g. at n=210). - N. J. A. Sloane (njas(AT)research.att.com), Sep 10 2008
|
|
REFERENCES
|
G. Tenenbaum. Introduction to Analytic and Probabilistic Number Theory. (Cambridge Studies in Advanced Mathematics 1995).
|
|
LINKS
|
N. J. A. Sloane, Table of n, a(n) for n = 1..10000
Weisstein, Eric W., Semiprime. [From Nour-Eddine Fahssi (fahssin(AT)yahoo.fr), Mar 05 2009]
|
|
FORMULA
|
a(n)=\sum_{p<sqrt(n)}(Pi(x/p)-Pi(p)), where Pi(n) is the prime counting function, A000720, and the sum is over all primes less than sqrt(n). [From Nour-Eddine Fahssi (fahssin(AT)yahoo.fr), Mar 05 2009]
Asymptotically a(n)~ (n/Log(n))Log(Log(n)) [G. Tenenbaum pp 200--].
|
|
EXAMPLE
|
a(6)=1 since 2*3 is the only number of the form p*q less than or equal to 6.
|
|
MAPLE
|
f:=proc(n) local c, i, j, p, q; c:=0; for i from 1 to n do p:=ithprime(i); if p^2 >= n then break; fi; for j from i+1 to n do q:=ithprime(j); if p*q > n then break; fi; c:=c+1; od: od; RETURN(c); end; - N. J. A. Sloane (njas(AT)research.att.com), Sep 10 2008
|
|
MATHEMATICA
|
fPi[n_] := Sum[ PrimePi[n/ Prime@i] - i, {i, PrimePi@ Sqrt@ n}]; Array[ fPi, 81] (* Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 22 2008 *)
|
|
PROGRAM
|
(PARI) a(n)=sum(k=1, n, if(abs(omega(k)-2)+(1-issquarefree(k)), 0, 1))
|
|
CROSSREFS
|
Cf. A072000.
Sequence in context: A085501 A069623 A076411 this_sequence A029551 A132015 A120501
Adjacent sequences: A072610 A072611 A072612 this_sequence A072614 A072615 A072616
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 11 2002
|
|
|
Search completed in 0.002 seconds
|
