A300912 -id:A300912 - cp's OEIS frontend

A001358 Semiprimes (or biprimes): products of two primes.

4, 6, 9, 10, 14, 15, 21, 22, 25, 26, 33, 34, 35, 38, 39, 46, 49, 51, 55, 57, 58, 62, 65, 69, 74, 77, 82, 85, 86, 87, 91, 93, 94, 95, 106, 111, 115, 118, 119, 121, 122, 123, 129, 133, 134, 141, 142, 143, 145, 146, 155, 158, 159, 161, 166, 169, 177, 178, 183, 185, 187

Offset: 1

N. J. A. Sloane, R. K. Guy

Numbers of the form p*q where p and q are primes, not necessarily distinct.
These numbers are sometimes called semiprimes or 2-almost primes.
Numbers n such that Omega(n) = 2 where Omega(n) = A001222(n) is the sum of the exponents in the prime decomposition of n.
Complement of A100959; A064911(a(n)) = 1. - Reinhard Zumkeller, Nov 22 2004
The graph of this sequence appears to be a straight line with slope 4. However, the asymptotic formula shows that the linearity is an illusion and in fact a(n)/n ~ log(n)/log(log(n)) goes to infinity. See also the graph of A066265 = number of semiprimes < 10^n.
For numbers between 33 and 15495, semiprimes are more plentiful than any other k-almost prime. See A125149.
Numbers that are divisible by exactly 2 prime powers (not including 1). - Jason Kimberley, Oct 02 2011
The (disjoint) union of A006881 and A001248. - Jason Kimberley, Nov 11 2015
An equivalent definition of this sequence is a'(n) = smallest composite number which is not divided by any smaller composite number a'(1),...,a'(n-1). - Meir-Simchah Panzer, Jun 22 2016
The above characterization can be simplified to "Composite numbers not divisible by a smaller term." This shows that this is the equivalent of primes computed via Eratosthenes's sieve, but starting with the set of composite numbers (i.e., complement of 1 union primes) instead of all positive integers > 1. It's easy to see that iterating the method (using Eratosthenes's sieve each time on the remaining numbers, complement of the previously computed set) yields numbers with bigomega = k for k = 0, 1, 2, 3, ..., i.e., {1}, A000040, this, A014612, etc. - M. F. Hasler, Apr 24 2019
For all n except n = 2, a(n) is a deficient number. - Amrit Awasthi, Sep 10 2024
It is reasonable to assume that the "comforting numbers" which John T. Williams found in Chapter 3 of Milne's book "The House at Pooh Corner" are these semiprimes. Winnie-the-Pooh wonders whether he has 14 or 15 honey pots and concludes: "It's sort of comforting." To arrange a semiprime number of honey pots in a rectangular way, let's say on a shelf, with the larger divisor parallel to the wall, there is only one solution and this is for a simple mind like Winnie-the-Pooh comforting. - Ruediger Jehn, Dec 12 2024

			From _Gus Wiseman_, May 27 2021: (Start)
The sequence of terms together with their prime factors begins:
   4 = 2*2     46 = 2*23     91 = 7*13    141 = 3*47
   6 = 2*3     49 = 7*7      93 = 3*31    142 = 2*71
   9 = 3*3     51 = 3*17     94 = 2*47    143 = 11*13
  10 = 2*5     55 = 5*11     95 = 5*19    145 = 5*29
  14 = 2*7     57 = 3*19    106 = 2*53    146 = 2*73
  15 = 3*5     58 = 2*29    111 = 3*37    155 = 5*31
  21 = 3*7     62 = 2*31    115 = 5*23    158 = 2*79
  22 = 2*11    65 = 5*13    118 = 2*59    159 = 3*53
  25 = 5*5     69 = 3*23    119 = 7*17    161 = 7*23
  26 = 2*13    74 = 2*37    121 = 11*11   166 = 2*83
  33 = 3*11    77 = 7*11    122 = 2*61    169 = 13*13
  34 = 2*17    82 = 2*41    123 = 3*41    177 = 3*59
  35 = 5*7     85 = 5*17    129 = 3*43    178 = 2*89
  38 = 2*19    86 = 2*43    133 = 7*19    183 = 3*61
  39 = 3*13    87 = 3*29    134 = 2*67    185 = 5*37
(End)

Archimedeans Problems Drive, Eureka, 17 (1954), 8.
Raymond Ayoub, An Introduction to the Analytic Theory of Numbers, Amer. Math. Soc., 1963; Chapter II, Problem 60.
Edmund Landau, Handbuch der Lehre von der Verteilung der Primzahlen, Vol. 1, Teubner, Leipzig; third edition: Chelsea, New York (1974). See p. 211.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
John T. Williams, Pooh and the Philosophers, Dutton Books, 1995.

N. J. A. Sloane, Table of n, a(n) for n = 1..20000 (first 10000 terms from T. D. Noe)
Dragos Crisan and Radek Erban, On the counting function of semiprimes, INTEGERS, Vol. 21 (2021), #A122.
Daniel A. Goldston, Sidney W. Graham, János Pintz and Cem Y. Yildirim, Small gaps between primes or almost primes, Transactions of the American Mathematical Society, Vol. 361, No. 10 (2009), pp. 5285-5330, arXiv preprint, arXiv:math/0506067 [math.NT], 2005.
Richard K. Guy, Letters to N. J. A. Sloane, June-August 1968
Sh. T. Ishmukhametov and F. F. Sharifullina, On distribution of semiprime numbers, Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2014, No. 8, pp. 53-59. English translation, Russian Mathematics, Vol. 58, No. 8 (2014), pp. 43-48, alternative link.
Donovan Johnson, Jonathan Vos Post, and Robert G. Wilson v, Selected n and a(n). (2.5 MB)
Dixon Jones, Quickie 593, Mathematics Magazine, Vol. 47, No. 3, May 1974, p. 167.
Edmund Landau, Handbuch der Lehre von der Verteilung der Primzahlen, vol. 1 and vol. 2, Leipzig, Berlin, B. G. Teubner, 1909. See Vol. 1, p. 211.
Xianmeng Meng, On sums of three integers with a fixed number of prime factors, Journal of Number Theory, Vol. 114, No. 1 (2005), pp. 37-65.
Michael Penn, What makes a number "good"?, YouTube video, 2022.
Carlos Rivera, Conjecture 108: On the counting function of semiprimes, The Prime Puzzles & Problems Connection.
Eric Weisstein's World of Mathematics, Semiprime.
Eric Weisstein's World of Mathematics, Almost Prime.
Wikipedia, Almost prime.
Robert G. Wilson v, Subsequences at various powers of 10.
Index to sequences related to sums of cubes
Index entries for "core" sequences

Cf. A064911 (characteristic function).
Cf. A048623, A048639, A000040 (primes), A014612 (products of 3 primes), A014613, A014614, A072000 ("pi" for semiprimes), A065516 (first differences).
Cf. A077554, A077555, A002024, A072966, A100592, A014673, A068318, A061299, A087718, A089994, A089995, A096916, A096932, A106550, A106554, A108541, A108542, A126663, A131284, A138510, A138511, A072931, A088183, A171963, A237040 (semiprimes of form n^3 + 1).
Sequences listing r-almost primes, that is, the n such that A001222(n) = r: A000040 (r=1), this sequence (r=2), A014612 (r=3), A014613 (r=4), A014614 (r=5), A046306 (r=6), A046308 (r=7), A046310 (r=8), A046312 (r=9), A046314 (r=10), A069272 (r=11), A069273 (r=12), A069274 (r=13), A069275 (r=14), A069276 (r=15), A069277 (r=16), A069278 (r=17), A069279 (r=18), A069280 (r=19), A069281 (r=20).
These are the Heinz numbers of length-2 partitions, counted by A004526.
The squarefree case is A006881 with odd/even terms A046388/A100484 (except 4).
Including primes gives A037143.
The odd/even terms are A046315/A100484.
Partial sums are A062198.
The prime factors are A084126/A084127.
Grouping by greater factor gives A087112.
The product/sum/difference of prime indices is A087794/A176504/A176506.
Positions of even/odd terms are A115392/A289182.
The terms with relatively prime/divisible prime indices are A300912/A318990.
Factorizations using these terms are counted by A320655.
The prime indices are A338898/A338912/A338913.
Grouping by weight (sum of prime indices) gives A338904, with row sums A024697.
The terms with even/odd weight are A338906/A338907.
The terms with odd/even prime indices are A338910/A338911.
The least/greatest term of weight n is A339114/A339115.
Cf. A014342, A098350, A112141, A320732, A332765, A339003/A339004, A339116.

a001358 n = a001358_list !! (n-1)
a001358_list = filter ((== 2) . a001222) [1..]

[n: n in [2..200] | &+[d[2]: d in Factorization(n)] eq 2]; // Bruno Berselli, Sep 09 2015

A001358 := proc(n) option remember; local a; if n = 1 then 4; else for a from procname(n-1)+1 do if numtheory[bigomega](a) = 2 then return a; end if; end do: end if; end proc:
seq(A001358(n), n=1..120) ; # R. J. Mathar, Aug 12 2010

Select[Range[200], Plus@@Last/@FactorInteger[#] == 2 &] (* Zak Seidov, Jun 14 2005 *)
Select[Range[200], PrimeOmega[#]==2&] (* Harvey P. Dale, Jul 17 2011 *)

select( isA001358(n)={bigomega(n)==2}, [1..199]) \\ M. F. Hasler, Apr 09 2008; added select() Apr 24 2019

list(lim)=my(v=List(),t);forprime(p=2, sqrt(lim), t=p;forprime(q=p, lim\t, listput(v,t*q))); vecsort(Vec(v)) \\ Charles R Greathouse IV, Sep 11 2011

A1358=List(4); A001358(n)={while(#A1358M. F. Hasler, Apr 24 2019

from sympy import factorint
def ok(n): return sum(factorint(n).values()) == 2
print([k for k in range(1, 190) if ok(k)]) # Michael S. Branicky, Apr 30 2022

from math import isqrt
from sympy import primepi, prime
def A001358(n):
    def f(x): return int(n+x-sum(primepi(x//prime(k))-k+1 for k in range(1, primepi(isqrt(x))+1)))
    m, k = n, f(n)
    while m != k:
        m, k = k, f(k)
    return m # Chai Wah Wu, Jul 23 2024

a(n) ~ n*log(n)/log(log(n)) as n -> infinity [Landau, p. 211], [Ayoub].
Recurrence: a(1) = 4; for n > 1, a(n) = smallest composite number which is not a multiple of any of the previous terms. - Amarnath Murthy, Nov 10 2002
A174956(a(n)) = n. - Reinhard Zumkeller, Apr 03 2010
a(n) = A088707(n) - 1. - Reinhard Zumkeller, Feb 20 2012
Sum_{n>=1} 1/a(n)^s = (1/2)*(P(s)^2 + P(2*s)), where P is the prime zeta function. - Enrique Pérez Herrero, Jun 24 2012
sigma(a(n)) + phi(a(n)) - mu(a(n)) = 2*a(n) + 1. mu(a(n)) = ceiling(sqrt(a(n))) - floor(sqrt(a(n))). - Wesley Ivan Hurt, May 21 2013
mu(a(n)) = -Omega(a(n)) + omega(a(n)) + 1, where mu is the Moebius function (A008683), Omega is the count of prime factors with repetition, and omega is the count of distinct prime factors. - Alonso del Arte, May 09 2014
a(n) = A078840(2,n). - R. J. Mathar, Jan 30 2019
A100484 UNION A046315. - R. J. Mathar, Apr 19 2023
Conjecture: a(n)/n ~ (log(n)/log(log(n)))*(1-(M/log(log(n)))) as n -> oo, where M is the Mertens's constant (A077761). - Alain Rocchelli, Feb 02 2025

More terms from James Sellers, Aug 22 2000

A318991 Numbers whose consecutive prime indices are divisible. Heinz numbers of integer partitions in which each part is divisible by the next.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 31, 32, 34, 36, 37, 38, 39, 40, 41, 42, 43, 44, 46, 47, 48, 49, 50, 52, 53, 54, 56, 57, 58, 59, 61, 62, 63, 64, 65, 67, 68, 71, 72, 73, 74, 76, 78, 79, 80

Offset: 1

Gus Wiseman, Sep 06 2018

nonn

A prime index of n is a number m such that prime(m) divides n.

The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).

			The sequence of all dividing partitions (columns) begins:
   1  2  1  3  2  4  1  2  3  5  2  6  4  1  7  2  8  3  4  5  9  2  3  6  2  4
         1     1     1  2  1     1     1  1     2     1  2  1     1  3  1  2  1
                     1           1        1     1     1           1        2  1
                                          1                       1

Andrew Howroyd, Table of n, a(n) for n = 1..10000

Cf. A000040, A001221, A001222, A003238, A008480, A300912, A318990, A318992, A318993.

Select[Range[100],Or[#==1,PrimePowerQ[#],Divisible@@Reverse[PrimePi/@FactorInteger[#][[All,1]]]]&]

ok(n)={my(v=apply(primepi, factor(n)[,1])); for(i=2, #v, if(v[i]%v[i-1], return(0))); 1} \\ Andrew Howroyd, Oct 26 2018

A318992 Numbers whose consecutive prime indices are not all divisible.

Original entry on oeis.org

15, 30, 33, 35, 45, 51, 55, 60, 66, 69, 70, 75, 77, 85, 90, 91, 93, 95, 99, 102, 105, 110, 119, 120, 123, 132, 135, 138, 140, 141, 143, 145, 150, 153, 154, 155, 161, 165, 170, 175, 177, 180, 182, 186, 187, 190, 195, 198, 201, 203, 204, 205, 207, 209, 210, 215

Offset: 1

Gus Wiseman, Sep 06 2018

nonn

			The sequence of partitions whose Heinz numbers belong to the sequence begins: (3,2), (3,2,1), (5,2), (4,3), (3,2,2), (7,2), (5,3), (3,2,1,1), (5,2,1), (9,2), (4,3,1), (3,3,2), (5,4), (7,3), (3,2,2,1), (6,4), (11,2), (8,3), (5,2,2).

Andrew Howroyd, Table of n, a(n) for n = 1..10000

Cf. A000040, A001221, A001222, A008480, A289509, A300912, A318990, A318991, A318993.

Select[Range[100],!Or[#==1,PrimePowerQ[#],Divisible@@Reverse[PrimePi/@FactorInteger[#][[All,1]]]]&]

ok(n)={my(v=apply(primepi, factor(n)[,1])); for(i=2, #v, if(v[i]%v[i-1], return(1))); 0} \\ Andrew Howroyd, Oct 26 2018

A087794 Products of prime-indices of factors of semiprimes.

Original entry on oeis.org

1, 2, 4, 3, 4, 6, 8, 5, 9, 6, 10, 7, 12, 8, 12, 9, 16, 14, 15, 16, 10, 11, 18, 18, 12, 20, 13, 21, 14, 20, 24, 22, 15, 24, 16, 24, 27, 17, 28, 25, 18, 26, 28, 32, 19, 30, 20, 30, 30, 21, 33, 22, 32, 36, 23, 36, 34, 24, 36, 36, 35, 25, 38, 26, 40, 39, 27, 40, 40, 28, 42, 44, 29

Offset: 1

Reinhard Zumkeller, Oct 09 2003

nonn

A semiprime (A001358) is a product of any two prime numbers. A prime index of n is a number m such that the m-th prime number divides n. The multiset of prime indices of n is row n of A112798. - Gus Wiseman, Dec 04 2020

			A001358(20)=57=3*19=A000040(2)*A000040(8), therefore a(20)=2*8=16.
From _Gus Wiseman_, Dec 04 2020: (Start)
The sequence of all semiprimes together with the products of their prime indices begins:
   4: 1 * 1 = 1
   6: 1 * 2 = 2
   9: 2 * 2 = 4
  10: 1 * 3 = 3
  14: 1 * 4 = 4
  15: 2 * 3 = 6
  21: 2 * 4 = 8
  22: 1 * 5 = 5
  25: 3 * 3 = 9
  26: 1 * 6 = 6
(End)

A003963 is the version for not just semiprimes.
A176504 gives the sum of the same two indices.
A176506 gives the difference of the same two indices.
A339361 is the squarefree case.
A001358 lists semiprimes.
A006881 lists squarefree semiprimes.
A289182/A115392 list the positions of odd/even terms of A001358.
A338898/A338912/A338913 give the prime indices of semiprimes.
A338899/A270650/A270652 give the prime indices of squarefree semiprimes.
A338904 groups semiprimes by weight.
Cf. A001222, A046315, A056239, A065516, A084126, A084127, A112798, A128301, A300912, A318990, A320655, A338909, A339362.

Table[If[SquareFreeQ[n],Times@@PrimePi/@First/@FactorInteger[n],PrimePi[Sqrt[n]]^2],{n,Select[Range[100],PrimeOmega[#]==2&]}] (* Gus Wiseman, Dec 04 2020 *)

a(n) = A049084(A084126(n))*A049084(A084127(n)) = A003963(A001358(n)).

a(n) = A003963(A001358(n)) = A338912(n) * A338913(n). - Gus Wiseman, Dec 04 2020

A318990 Numbers of the form prime(x) * prime(y) where x divides y.

Original entry on oeis.org

4, 6, 9, 10, 14, 21, 22, 25, 26, 34, 38, 39, 46, 49, 57, 58, 62, 65, 74, 82, 86, 87, 94, 106, 111, 115, 118, 121, 122, 129, 133, 134, 142, 146, 158, 159, 166, 169, 178, 183, 185, 194, 202, 206, 213, 214, 218, 226, 235, 237, 254, 259, 262, 267, 274, 278, 289

Offset: 1

Gus Wiseman, Sep 06 2018

nonn

			The sequence of all dividing pairs (columns) begins:
  1  1  2  1  1  2  1  3  1  1  1  2  1  4  2  1  1  3  1  1  1  2  1  1
  1  2  2  3  4  4  5  3  6  7  8  6  9  4  8 10 11  6 12 13 14 10 15 16

Andrew Howroyd, Table of n, a(n) for n = 1..10000

A subset of A001358 (semiprimes), squarefree A006881.
The squarefree version is A339005.
The quotient is A358103 = A358104 / A358105.
A000040 lists the primes.
A001222 counts prime indices, distinct A001221.
A003963 multiplies together prime indices.
A056239 adds up prime indices.
A358192/A358193 gives quotients of semiprime indices.
Cf. A000837, A300912, A318991, A318992, A318993.
Cf. A000720, A027751, A032741, A215366, A296150.
Cf. A289508, A289509, A358106.

Select[Range[100],And[PrimeOmega[#]==2,Or[PrimePowerQ[#],Divisible@@Reverse[PrimePi/@FactorInteger[#][[All,1]]]]]&]

ok(n)={my(f=factor(n)); bigomega(f)==2 && (#f~==1 || primepi(f[2,1]) % primepi(f[1,1]) == 0)} \\ Andrew Howroyd, Oct 26 2018

A338910 Numbers of the form prime(x) * prime(y) where x and y are both odd.

Original entry on oeis.org

4, 10, 22, 25, 34, 46, 55, 62, 82, 85, 94, 115, 118, 121, 134, 146, 155, 166, 187, 194, 205, 206, 218, 235, 253, 254, 274, 289, 295, 298, 314, 334, 335, 341, 358, 365, 382, 391, 394, 415, 422, 451, 454, 466, 482, 485, 514, 515, 517, 527, 529, 538, 545, 554

Offset: 1

Gus Wiseman, Nov 20 2020

nonn

			The sequence of terms together with their prime indices begins:
      4: {1,1}     146: {1,21}    314: {1,37}
     10: {1,3}     155: {3,11}    334: {1,39}
     22: {1,5}     166: {1,23}    335: {3,19}
     25: {3,3}     187: {5,7}     341: {5,11}
     34: {1,7}     194: {1,25}    358: {1,41}
     46: {1,9}     205: {3,13}    365: {3,21}
     55: {3,5}     206: {1,27}    382: {1,43}
     62: {1,11}    218: {1,29}    391: {7,9}
     82: {1,13}    235: {3,15}    394: {1,45}
     85: {3,7}     253: {5,9}     415: {3,23}
     94: {1,15}    254: {1,31}    422: {1,47}
    115: {3,9}     274: {1,33}    451: {5,13}
    118: {1,17}    289: {7,7}     454: {1,49}
    121: {5,5}     295: {3,17}    466: {1,51}
    134: {1,19}    298: {1,35}    482: {1,53}

A338911 is the even instead of odd version.
A339003 is the squarefree case.
A001221 counts distinct prime indices.
A001222 counts prime indices.
A001358 lists semiprimes, with odd/even terms A046315/A100484.
A006881 lists squarefree semiprimes, with odd/even terms A046388/A100484.
A289182/A115392 list the positions of odd/even terms of A001358.
A300912 lists semiprimes with relatively prime indices.
A318990 lists semiprimes with divisible indices.
A338904 groups semiprimes by weight.
A338906/A338907 are semiprimes of even/odd weight.
A338898, A338912, and A338913 give the prime indices of semiprimes, with product A087794, sum A176504, and difference A176506.
A338899, A270650, and A270652 give prime indices of squarefree semiprimes.
A338909 lists semiprimes with non-relatively prime indices.
Cf. A005117, A037143, A055684, A056239, A065516, A112798, A195017, A320655, A320732, A320892, A339004.

q:= n-> (l-> add(i[2], i=l)=2 and andmap(i->
    numtheory[pi](i[1])::odd, l))(ifactors(n)[2]):
select(q, [$1..1000])[];  # Alois P. Heinz, Nov 23 2020

Select[Range[100],PrimeOmega[#]==2&&OddQ[Times@@PrimePi/@First/@FactorInteger[#]]&]

from math import isqrt
from sympy import primepi, primerange
def A338910(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        kmin = kmax >> 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x): return n+x-sum(primepi(x//p)-a>>1 for a,p in enumerate(primerange(isqrt(x)+1),-1) if a&1)
    return bisection(f,n,n) # Chai Wah Wu, Apr 03 2025

Numbers m such that A001222(m) = A195017(m) = 2. - Peter Munn, Jan 17 2021

A338911 Numbers of the form prime(x) * prime(y) where x and y are both even.

Original entry on oeis.org

9, 21, 39, 49, 57, 87, 91, 111, 129, 133, 159, 169, 183, 203, 213, 237, 247, 259, 267, 301, 303, 321, 339, 361, 371, 377, 393, 417, 427, 453, 481, 489, 497, 519, 543, 551, 553, 559, 579, 597, 623, 669, 687, 689, 703, 707, 717, 749, 753, 789, 791, 793, 813, 817

Offset: 1

Gus Wiseman, Nov 20 2020

nonn

			The sequence of terms together with their prime indices begins:
      9: {2,2}     237: {2,22}    481: {6,12}
     21: {2,4}     247: {6,8}     489: {2,38}
     39: {2,6}     259: {4,12}    497: {4,20}
     49: {4,4}     267: {2,24}    519: {2,40}
     57: {2,8}     301: {4,14}    543: {2,42}
     87: {2,10}    303: {2,26}    551: {8,10}
     91: {4,6}     321: {2,28}    553: {4,22}
    111: {2,12}    339: {2,30}    559: {6,14}
    129: {2,14}    361: {8,8}     579: {2,44}
    133: {4,8}     371: {4,16}    597: {2,46}
    159: {2,16}    377: {6,10}    623: {4,24}
    169: {6,6}     393: {2,32}    669: {2,48}
    183: {2,18}    417: {2,34}    687: {2,50}
    203: {4,10}    427: {4,18}    689: {6,16}
    213: {2,20}    453: {2,36}    703: {8,12}

A338910 is the odd instead of even version.
A339004 is the squarefree case.
A001221 counts distinct prime indices.
A001222 counts prime indices.
A001358 lists semiprimes, with odd/even terms A046315/A100484.
A006881 lists squarefree semiprimes, with odd/even terms A046388/A100484.
A338899, A270650, A270652 list prime indices of squarefree semiprimes.
A289182/A115392 list the positions of odd/even terms of A001358.
A300912 lists semiprimes with relatively prime indices.
A318990 lists semiprimes with divisible indices.
A338904 groups semiprimes by weight.
A338906/A338907 list semiprimes of even/odd weight.
A338909 lists semiprimes with non-relatively prime indices.
A338912 and A338913 list prime indices of semiprimes, with product A087794, sum A176504, and difference A176506.
Cf. A005117, A037143, A055684, A056239, A065516, A112798, A128301, A195017, A320655, A320732, A320892, A338898, A339002, A339003.

q:= n-> (l-> add(i[2], i=l)=2 and andmap(i->
    numtheory[pi](i[1])::even, l))(ifactors(n)[2]):
select(q, [$1..1000])[];  # Alois P. Heinz, Nov 23 2020

Select[Range[100],PrimeOmega[#]==2&&OddQ[Times@@(1+PrimePi/@First/@FactorInteger[#])]&]

from math import isqrt
from sympy import primerange, primepi
def A338911(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        kmin = kmax >> 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x): return n+x-sum(primepi(x//p)-a>>1 for a,p in enumerate(primerange(isqrt(x)+1),-1) if a&1^1)
    return bisection(f,n,n) # Chai Wah Wu, Apr 03 2025

Numbers m such that A001222(m) = 2 and A195017(m) = -2. - Peter Munn, Jan 17 2021

A339003 Numbers of the form prime(x) * prime(y) where x and y are distinct and both odd.

Original entry on oeis.org

10, 22, 34, 46, 55, 62, 82, 85, 94, 115, 118, 134, 146, 155, 166, 187, 194, 205, 206, 218, 235, 253, 254, 274, 295, 298, 314, 334, 335, 341, 358, 365, 382, 391, 394, 415, 422, 451, 454, 466, 482, 485, 514, 515, 517, 527, 538, 545, 554, 566, 614, 626, 635, 649

Offset: 1

Gus Wiseman, Nov 21 2020

nonn

The squarefree semiprimes in A332822. - Peter Munn, Dec 25 2020

			The sequence of terms together with their prime indices begins:
     10: {1,3}     187: {5,7}     358: {1,41}    527: {7,11}
     22: {1,5}     194: {1,25}    365: {3,21}    538: {1,57}
     34: {1,7}     205: {3,13}    382: {1,43}    545: {3,29}
     46: {1,9}     206: {1,27}    391: {7,9}     554: {1,59}
     55: {3,5}     218: {1,29}    394: {1,45}    566: {1,61}
     62: {1,11}    235: {3,15}    415: {3,23}    614: {1,63}
     82: {1,13}    253: {5,9}     422: {1,47}    626: {1,65}
     85: {3,7}     254: {1,31}    451: {5,13}    635: {3,31}
     94: {1,15}    274: {1,33}    454: {1,49}    649: {5,17}
    115: {3,9}     295: {3,17}    466: {1,51}    662: {1,67}
    118: {1,17}    298: {1,35}    482: {1,53}    685: {3,33}
    134: {1,19}    314: {1,37}    485: {3,25}    694: {1,69}
    146: {1,21}    334: {1,39}    514: {1,55}    697: {7,13}
    155: {3,11}    335: {3,19}    515: {3,27}    706: {1,71}
    166: {1,23}    341: {5,11}    517: {5,15}    713: {9,11}

A338910 is the not necessarily squarefree version.
A339004 is the even instead of odd version.
A001358 lists semiprimes, with odd and even terms A046315 and A100484.
A005117 lists squarefree numbers.
A006881 lists squarefree semiprimes, with odd and even terms A046388 and A100484.
A289182/A115392 list the positions of odd/even terms of A001358.
A300912 lists products of two primes of relatively prime index.
A320656 counts factorizations into squarefree semiprimes.
A338898, A338912, and A338913 give the prime indices of semiprimes, with product A087794, sum A176504, and difference A176506.
A338899, A270650, and A270652 give the prime indices of squarefree semiprimes, with difference A338900.
A338904 groups semiprimes by weight.
A338906/A338907 list semiprimes of even/odd weight.
A339002 lists products of two distinct primes of non-relatively prime index.
A339005 lists products of two distinct primes of divisible index.
Cf. A001221, A001222, A056239, A112798, A166237, A195017, A318990, A320911, A338901, A338903, A338911.
Subsequence of A332822.

Select[Range[100],SquareFreeQ[#]&&PrimeOmega[#]==2&&OddQ[Times@@PrimePi/@First/@FactorInteger[#]]&]

from math import isqrt
from sympy import primepi, primerange
def A339003(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        kmin = kmax >> 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x): return n+x-sum(primepi(x//p)-a>>1 for a,p in enumerate(primerange(isqrt(x)+1),1) if a&1)
    return bisection(f,n,n) # Chai Wah Wu, Apr 03 2025

Numbers m such that A001221(m) = A001222(m) = A195017(m) = 2. - Peter Munn, Dec 31 2020

A339004 Numbers of the form prime(x) * prime(y) where x and y are distinct and both even.

Original entry on oeis.org

21, 39, 57, 87, 91, 111, 129, 133, 159, 183, 203, 213, 237, 247, 259, 267, 301, 303, 321, 339, 371, 377, 393, 417, 427, 453, 481, 489, 497, 519, 543, 551, 553, 559, 579, 597, 623, 669, 687, 689, 703, 707, 717, 749, 753, 789, 791, 793, 813, 817, 843, 879, 917

Offset: 1

Gus Wiseman, Nov 22 2020

nonn

The squarefree semiprimes in A332821. - Peter Munn, Dec 25 2020

			The sequence of terms together with their prime indices begins:
     21: {2,4}     267: {2,24}    543: {2,42}
     39: {2,6}     301: {4,14}    551: {8,10}
     57: {2,8}     303: {2,26}    553: {4,22}
     87: {2,10}    321: {2,28}    559: {6,14}
     91: {4,6}     339: {2,30}    579: {2,44}
    111: {2,12}    371: {4,16}    597: {2,46}
    129: {2,14}    377: {6,10}    623: {4,24}
    133: {4,8}     393: {2,32}    669: {2,48}
    159: {2,16}    417: {2,34}    687: {2,50}
    183: {2,18}    427: {4,18}    689: {6,16}
    203: {4,10}    453: {2,36}    703: {8,12}
    213: {2,20}    481: {6,12}    707: {4,26}
    237: {2,22}    489: {2,38}    717: {2,52}
    247: {6,8}     497: {4,20}    749: {4,28}
    259: {4,12}    519: {2,40}    753: {2,54}

A338911 is the not necessarily squarefree version.
A339003 is the odd instead of even version, with not necessarily squarefree version A338910.
A001358 lists semiprimes, with odd/even terms A046315/A100484.
A005117 lists squarefree numbers.
A006881 lists squarefree semiprimes, with odd/even terms A046388/A100484.
A289182/A115392 list the positions of odd/even terms in A001358.
A300912 lists products of pairs of primes with relatively prime indices.
A318990 lists products of pairs of primes with divisible indices.
A320656 counts factorizations into squarefree semiprimes.
A338898, A338912, and A338913 give the prime indices of semiprimes, with product A087794, sum A176504, and difference A176506.
A338899, A270650, and A270652 give the prime indices of squarefree semiprimes, with difference A338900.
A338904 groups semiprimes by weight.
A338906/A338907 list semiprimes of even/odd weight.
Cf. A000040, A001221, A001222, A056239, A112798, A166237, A195017, A320911, A338901, A338903, A339002.
Subsequence of A332821.

Select[Range[100],SquareFreeQ[#]&&PrimeOmega[#]==2&&OddQ[Times@@(1+ PrimePi/@First/@FactorInteger[#])]&]

from math import isqrt
from sympy import primepi, primerange
def A339004(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        kmin = kmax >> 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x): return n+x-sum(primepi(x//p)-a>>1 for a,p in enumerate(primerange(isqrt(x)+1),1) if a&1^1)
    return bisection(f,n,n) # Chai Wah Wu, Apr 03 2025

Numbers m such that A001221(m) = A001222(m) = 2 and A195017(m) = -2. - Peter Munn, Dec 31 2020

A339005 Numbers of the form prime(x) * prime(y) where x properly divides y. Squarefree semiprimes with divisible prime indices.

Original entry on oeis.org

6, 10, 14, 21, 22, 26, 34, 38, 39, 46, 57, 58, 62, 65, 74, 82, 86, 87, 94, 106, 111, 115, 118, 122, 129, 133, 134, 142, 146, 158, 159, 166, 178, 183, 185, 194, 202, 206, 213, 214, 218, 226, 235, 237, 254, 259, 262, 267, 274, 278, 298, 302, 303, 305, 314, 319

Offset: 1

Gus Wiseman, Dec 05 2020

nonn

A squarefree semiprime (A006881) is a product of any two distinct prime numbers. A prime index of n is a number m such that the m-th prime number divides n. The multiset of prime indices of n is row n of A112798.

			The sequence of terms together with their prime indices begins:
    6: {1,2}    82: {1,13}  159: {2,16}  259: {4,12}
   10: {1,3}    86: {1,14}  166: {1,23}  262: {1,32}
   14: {1,4}    87: {2,10}  178: {1,24}  267: {2,24}
   21: {2,4}    94: {1,15}  183: {2,18}  274: {1,33}
   22: {1,5}   106: {1,16}  185: {3,12}  278: {1,34}
   26: {1,6}   111: {2,12}  194: {1,25}  298: {1,35}
   34: {1,7}   115: {3,9}   202: {1,26}  302: {1,36}
   38: {1,8}   118: {1,17}  206: {1,27}  303: {2,26}
   39: {2,6}   122: {1,18}  213: {2,20}  305: {3,18}
   46: {1,9}   129: {2,14}  214: {1,28}  314: {1,37}
   57: {2,8}   133: {4,8}   218: {1,29}  319: {5,10}
   58: {1,10}  134: {1,19}  226: {1,30}  321: {2,28}
   62: {1,11}  142: {1,20}  235: {3,15}  326: {1,38}
   65: {3,6}   146: {1,21}  237: {2,22}  334: {1,39}
   74: {1,12}  158: {1,22}  254: {1,31}  339: {2,30}

A300912 is the version for relative primality.
A318990 is the not necessarily squarefree version.
A339002 is the version for non-relative primality.
A339003 is the version for odd indices.
A339004 is the version for even indices
A001358 lists semiprimes.
A005117 lists squarefree numbers.
A006881 lists squarefree semiprimes, with odd/even terms A046388/A100484.
A320655 counts factorizations into semiprimes.
A320656 counts factorizations into squarefree semiprimes.
A338898/A338912/A338913 give the prime indices of semiprimes, with product A087794, sum A176504, and difference A176506.
A338899/A270650/A270652 give the prime indices of squarefree semiprimes, with difference A338900.
Cf. A001221, A112798, A166237, A320911, A338901, A338904, A338909.

Select[Range[100],SquareFreeQ[#]&&PrimeOmega[#]==2&& Divisible@@Reverse[PrimePi/@First/@FactorInteger[#]]&]

Equals A318990 \ A000290.

cp's OEIS Frontend

A001358 Semiprimes (or biprimes): products of two primes.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

PARI

PARI

Python

Python

Formula

Extensions

A318991 Numbers whose consecutive prime indices are divisible. Heinz numbers of integer partitions in which each part is divisible by the next.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A318992 Numbers whose consecutive prime indices are not all divisible.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A087794 Products of prime-indices of factors of semiprimes.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A318990 Numbers of the form prime(x) * prime(y) where x divides y.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A338910 Numbers of the form prime(x) * prime(y) where x and y are both odd.

Views

Author

Keywords

Examples

Crossrefs

Programs

Maple

Mathematica

Python

Formula

A338911 Numbers of the form prime(x) * prime(y) where x and y are both even.

Views

Author

Keywords

Examples

Crossrefs