|
| |
|
|
A006881
|
|
Numbers that are the product of two distinct primes.
(Formerly M4082)
|
|
177
| |
|
|
6, 10, 14, 15, 21, 22, 26, 33, 34, 35, 38, 39, 46, 51, 55, 57, 58, 62, 65, 69, 74, 77, 82, 85, 86, 87, 91, 93, 94, 95, 106, 111, 115, 118, 119, 122, 123, 129, 133, 134, 141, 142, 143, 145, 146, 155, 158, 159, 161, 166, 177, 178, 183, 185, 187, 194, 201, 202, 203, 205
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Numbers n such that phi(n)+sigma(n)=2*(n+1) - Benoit Cloitre, Mar 02 2002
n such that tau(n)=omega(n)^omega(n) - Benoit Cloitre, Sep 10 2002
Could also be called squarefree semiprimes (or 2-almost primes). - Rick L. Shepherd, May 11 2003
Goldston et al. proved that lim inf [as n approaches infinity] (a(n+1) - a(n)) =< 26. If an appropriate generalization of the Elliott-Halberstam Conjecture is true, then the above bound can be improved to 6. - Jonathan Vos Post, Jun 20 2005
A000005(a(n)^(k-1)) = A000290(k) for all k>0. - Reinhard Zumkeller, Mar 04 2007
The maximal number of consecutive integers in this sequence is 3 - there can not be 4 consecutive integers because one of them would be divisible by 4 and therefore would not be product of distinct primes. There are several examples of 3 consecutive integers in this sequence. The first one is 33=3.11, 34=2.17, 35=5.7. - Matias Saucedo (solomatias(AT)yahoo.com.ar), Mar 15 2008
A109810(a(n)) = 4; A178254(a(n)) = 6. [From Reinhard Zumkeller, May 24 2010]
A056595(a(n)) = 3. [Reinhard Zumkeller, Aug 15 2011]
a(n) = A096916(n) * A070647(n). [Reinhard Zumkeller, Sep 23 2011]
|
|
|
REFERENCES
| D. A. Goldston, S. W. Graham, J. Pimtz and Y. Yildirim, "Small Gaps Between Primes or Almost Primes", arXiv:math.NT/0506067 v1, 3 2005.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=1..10000
Eric Weisstein's World of Mathematics, Semiprime
|
|
|
MATHEMATICA
| A006881 = Take[ Sort@ Flatten@ Table[Prime[m]*Prime[n], {n, 2, 26}, {m, n - 1}], 60] (* Robert G. Wilson v, Dec 28 2005 *)
|
|
|
PROG
| (PARI) for(n=1, 214, if(bigomega(n)==2&&omega(n)==2, print1(n, ", "))) for(n=1, 214, if(bigomega(n)==2&&issquarefree(n), print1(n, ", ")))
(PARI) list(lim)=my(v=List()); forprime(p=2, sqrt(lim), forprime(q=p+1, lim\p, listput(v, p*q))); vecsort(Vec(v)) \\ Charles R Greathouse IV, Jul 20 2011
(Haskell)
a006881 n = a006881_list !! (n-1)
a006881_list = filter chi [1..] where
chi n = p /= q && a010051 q == 1 where
p = a020639 n
q = n `div` p
-- Reinhard Zumkeller, Aug 07 2011
|
|
|
CROSSREFS
| Cf. A046386, A046387, A067885 (product of 4, 5 and 6 distinct primes, resp.)
Cf. A030229, A051709.
Cf. A001221 (omega(n)), A001222 (bigomega(n)), A001358 (semiprimes), A005117 (squarefree), A007304 (squarefree 3-almost primes).
Cf. A039833 (subsequence).
Cf. A016105 (subsequence).
Sequence in context: A000469 A120944 A052053 * A030229 A201650 A201514
Adjacent sequences: A006878 A006879 A006880 * A006882 A006883 A006884
|
|
|
KEYWORD
| nonn,easy,nice
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Robert P. Munafo (mrob(AT)mrob.com), Simon Plouffe (simon.plouffe(AT)gmail.com)
|
| |
|
|
