A101638 -id:A101638 - cp's OEIS frontend

A046310 Numbers that are divisible by exactly 8 primes counting multiplicity.

256, 384, 576, 640, 864, 896, 960, 1296, 1344, 1408, 1440, 1600, 1664, 1944, 2016, 2112, 2160, 2176, 2240, 2400, 2432, 2496, 2916, 2944, 3024, 3136, 3168, 3240, 3264, 3360, 3520, 3600, 3648, 3712, 3744, 3968, 4000, 4160, 4374, 4416, 4536, 4704, 4736

Offset: 1

Patrick De Geest, Jun 15 1998

nonn

Also called 8-almost primes. Products of exactly 8 primes (not necessarily distinct). Any 8-almost prime can be represented in several ways as a product of two 4-almost primes A014613 and in several ways as a product of four semiprimes A001358. - Jonathan Vos Post, Dec 11 2004

Odd terms are in A046321; first odd term is a(64)=6561=3^8. - Zak Seidov, Feb 08 2016

T. D. Noe, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Reference

Cf. A046309, A120049 (number of 8-almost primes <= 10^n).
Cf. A101637, A101638, A101605, A101606.
Sequences listing r-almost primes, that is, the n such that A001222(n) = r: A000040 (r = 1), A001358 (r = 2), A014612 (r = 3), A014613 (r = 4), A014614 (r = 5), A046306 (r = 6), A046308 (r = 7), this sequence (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).
Cf. A046321.

A046310 := proc(n)
    option remember;
    if n = 1 then
        2^8 ;
    else
        for a from procname(n-1)+1 do
            if numtheory[bigomega](a) = 8 then
                return a;
            end if;
        end do:
    end if;
end proc:
seq(A046310(n),n=1..30) ; # R. J. Mathar, Dec 21 2018

Select[Range[1600], Plus @@ Last /@ FactorInteger[ # ] == 8 &] (* Vladimir Joseph Stephan Orlovsky, Apr 23 2008 *)
Select[Range[5000],PrimeOmega[#]==8&]  (* Harvey P. Dale, Apr 19 2011 *)

is(n)=bigomega(n)==8 \\ Charles R Greathouse IV, Mar 21 2013

from math import prod, isqrt
from sympy import primerange, integer_nthroot, primepi
def A046310(n):
    def g(x,a,b,c,m): yield from (((d,) for d in enumerate(primerange(b,isqrt(x//c)+1),a)) if m==2 else (((a2,b2),)+d for a2,b2 in enumerate(primerange(b,integer_nthroot(x//c,m)[0]+1),a) for d in g(x,a2,b2,c*b2,m-1)))
    def f(x): return int(n-1+x-sum(primepi(x//prod(c[1] for c in a))-a[-1][0] for a in g(x,0,1,1,8)))
    kmin, kmax = 1,2
    while f(kmax) >= kmax:
        kmax <<= 1
    while True:
        kmid = kmax+kmin>>1
        if f(kmid) < kmid:
            kmax = kmid
        else:
            kmin = kmid
        if kmax-kmin <= 1:
            break
    return kmax # Chai Wah Wu, Aug 23 2024

Product p_i^e_i with Sum e_i = 8.
a(n) ~ 5040n log n / (log log n)^7. - Charles R Greathouse IV, May 06 2013
a(n) = A078840(8,n). - R. J. Mathar, Jan 30 2019

A046314 Numbers that are divisible by exactly 10 primes with multiplicity.

Original entry on oeis.org

1024, 1536, 2304, 2560, 3456, 3584, 3840, 5184, 5376, 5632, 5760, 6400, 6656, 7776, 8064, 8448, 8640, 8704, 8960, 9600, 9728, 9984, 11664, 11776, 12096, 12544, 12672, 12960, 13056, 13440, 14080, 14400, 14592, 14848, 14976, 15872, 16000, 16640

Offset: 1

Patrick De Geest, Jun 15 1998

nonn

Also called 10-almost primes. Products of exactly 10 primes (not necessarily distinct). Any 10-almost prime can be represented in several ways as a product of two 5-almost primes A014614 and in several ways as a product of five semiprimes A001358. - Jonathan Vos Post, Dec 11 2004

T. D. Noe, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Reference

Cf. A046313, A120051 (number of 10-almost primes <= 10^n).
Cf. A101637, A101638, A101605, A101606.
Sequences listing r-almost primes, that is, the n such that A001222(n) = r: A000040 (r = 1), A001358 (r = 2), A014612 (r = 3), A014613 (r = 4), A014614 (r = 5), A046306 (r = 6), A046308 (r = 7), A046310 (r = 8), A046312 (r = 9), this sequence (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). - Jason Kimberley, Oct 02 2011

Select[Range[5000], Plus @@ Last /@ FactorInteger[ # ] == 10 &] (* Vladimir Joseph Stephan Orlovsky, Apr 23 2008 *)
Select[Range[17000],PrimeOmega[#]==10&] (* Harvey P. Dale, Jun 23 2018 *)

is(n)=bigomega(n)==10 \\ Charles R Greathouse IV, Mar 21 2013

from math import isqrt, prod
from sympy import primerange, integer_nthroot, primepi
def A046314(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def g(x,a,b,c,m): yield from (((d,) for d in enumerate(primerange(b,isqrt(x//c)+1),a)) if m==2 else (((a2,b2),)+d for a2,b2 in enumerate(primerange(b,integer_nthroot(x//c,m)[0]+1),a) for d in g(x,a2,b2,c*b2,m-1)))
    def f(x): return int(n+x-sum(primepi(x//prod(c[1] for c in a))-a[-1][0] for a in g(x,0,1,1,10)))
    return bisection(f,n,n) # Chai Wah Wu, Nov 03 2024

Product p_i^e_i with Sum e_i = 10.

a(n) ~ 362880n log n / (log log n)^9. - Charles R Greathouse IV, May 06 2013

A046312 Numbers that are divisible by exactly 9 primes with multiplicity.

Original entry on oeis.org

512, 768, 1152, 1280, 1728, 1792, 1920, 2592, 2688, 2816, 2880, 3200, 3328, 3888, 4032, 4224, 4320, 4352, 4480, 4800, 4864, 4992, 5832, 5888, 6048, 6272, 6336, 6480, 6528, 6720, 7040, 7200, 7296, 7424, 7488, 7936, 8000, 8320, 8748, 8832, 9072, 9408

Offset: 1

Patrick De Geest, Jun 15 1998

nonn

Also called 9-almost primes. Products of exactly 9 primes (not necessarily distinct). - Jonathan Vos Post, Dec 11 2004

T. D. Noe, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Reference

Cf. A046311, A120050 (number of 9-almost primes <= 10^n).
Cf. A101637, A101638, A101605, A101606.
Sequences listing r-almost primes, that is, the n such that A001222(n) = r: A000040 (r = 1), A001358 (r = 2), A014612 (r = 3), A014613 (r = 4), A014614 (r = 5), A046306 (r = 6), A046308 (r = 7), A046310 (r = 8), this sequence (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). - Jason Kimberley, Oct 02 2011

Select[Range[2200], Plus @@ Last /@ FactorInteger[ # ] == 9 &] (* Vladimir Joseph Stephan Orlovsky, Apr 23 2008 *)
Select[Range[10000],PrimeOmega[#]==9&] (* Harvey P. Dale, Oct 24 2020 *)

is(n)=bigomega(n)==9 \\ Charles R Greathouse IV, Mar 21 2013

from math import isqrt, prod
from sympy import primerange, integer_nthroot, primepi
def A046312(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def g(x,a,b,c,m): yield from (((d,) for d in enumerate(primerange(b,isqrt(x//c)+1),a)) if m==2 else (((a2,b2),)+d for a2,b2 in enumerate(primerange(b,integer_nthroot(x//c,m)[0]+1),a) for d in g(x,a2,b2,c*b2,m-1)))
    def f(x): return int(n+x-sum(primepi(x//prod(c[1] for c in a))-a[-1][0] for a in g(x,0,1,1,9)))
    return bisection(f,n,n) # Chai Wah Wu, Nov 03 2024

Product p_i^e_i with Sum e_i = 9.

a(n) ~ 40320n log n / (log log n)^8. - Charles R Greathouse IV, May 06 2013

A069273 12-almost primes (generalization of semiprimes).

Original entry on oeis.org

4096, 6144, 9216, 10240, 13824, 14336, 15360, 20736, 21504, 22528, 23040, 25600, 26624, 31104, 32256, 33792, 34560, 34816, 35840, 38400, 38912, 39936, 46656, 47104, 48384, 50176, 50688, 51840, 52224, 53760, 56320, 57600, 58368, 59392

Offset: 1

Rick L. Shepherd, Mar 13 2002

nonn

Product of 12 not necessarily distinct primes.
Divisible by exactly 12 prime powers (not including 1).
Any 12-almost prime can be represented in at least one way as a product of two 6-almost primes A046306, three 4-almost primes A014613, four 3-almost primes A014612, or six semiprimes A001358. - Jonathan Vos Post, Dec 11 2004

D. W. Wilson, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Almost Prime.

Cf. A101637, A101638, A101605, A101606.

Sequences listing r-almost primes, that is, the n such that A001222(n) = r: A000040 (r = 1), A001358 (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), this sequence (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). - Jason Kimberley, Oct 02 2011

Select[Range[20000], Plus @@ Last /@ FactorInteger[ # ] == 12 &] (* Vladimir Joseph Stephan Orlovsky, Apr 23 2008 *)
Select[Range[60000],PrimeOmega[#]==12&] (* Harvey P. Dale, May 01 2019 *)

k=12; start=2^k; finish=70000; v=[]; for(n=start,finish, if(bigomega(n)==k,v=concat(v,n))); v

from math import isqrt, prod
from sympy import primerange, integer_nthroot, primepi
def A069273(n):
    def bisection(f, kmin=0, kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def g(x, a, b, c, m): yield from (((d, ) for d in enumerate(primerange(b, isqrt(x//c)+1), a)) if m==2 else (((a2, b2), )+d for a2, b2 in enumerate(primerange(b, integer_nthroot(x//c, m)[0]+1), a) for d in g(x, a2, b2, c*b2, m-1)))
    def f(x): return int(n+x-sum(primepi(x//prod(c[1] for c in a))-a[-1][0] for a in g(x, 0, 1, 1, 12)))
    return bisection(f, n, n) # Chai Wah Wu, Nov 03 2024

Product p_i^e_i with Sum e_i = 12.

A069279 Products of exactly 18 primes (generalization of semiprimes).

Original entry on oeis.org

262144, 393216, 589824, 655360, 884736, 917504, 983040, 1327104, 1376256, 1441792, 1474560, 1638400, 1703936, 1990656, 2064384, 2162688, 2211840, 2228224, 2293760, 2457600, 2490368, 2555904, 2985984, 3014656, 3096576, 3211264, 3244032, 3317760, 3342336, 3440640

Offset: 1

Rick L. Shepherd, Mar 13 2002

nonn

Product of 18 not necessarily distinct primes.

Divisible by exactly 18 prime powers (not including 1).

D. W. Wilson, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Almost Prime.

Cf. A101637, A101638, A101605, A101606.

Sequences listing r-almost primes, that is, the n such that A001222(n) = r: A000040 (r = 1), A001358 (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), this sequence (r = 18), A069280 (r = 19), A069281 (r = 20). - Jason Kimberley, Oct 02 2011

Select[Range[31*10^5],PrimeOmega[#]==18&] (* Harvey P. Dale, Apr 05 2015 *)

k=18; start=2^k; finish=4000000; v=[]; for(n=start,finish, if(bigomega(n)==k,v=concat(v,n))); v

from math import prod, isqrt
from sympy import primerange, integer_nthroot, primepi
def A069279(n):
    def g(x,a,b,c,m): yield from (((d,) for d in enumerate(primerange(b,isqrt(x//c)+1),a)) if m==2 else (((a2,b2),)+d for a2,b2 in enumerate(primerange(b,integer_nthroot(x//c,m)[0]+1),a) for d in g(x,a2,b2,c*b2,m-1)))
    def f(x): return int(n-1+x-sum(primepi(x//prod(c[1] for c in a))-a[-1][0] for a in g(x,0,1,1,18)))
    kmin, kmax = 1,2
    while f(kmax) >= kmax:
        kmax <<= 1
    while True:
        kmid = kmax+kmin>>1
        if f(kmid) < kmid:
            kmax = kmid
        else:
            kmin = kmid
        if kmax-kmin <= 1:
            break
    return kmax # Chai Wah Wu, Aug 23 2024

Product p_i^e_i with Sum e_i = 18.

A069281 20-almost primes (generalization of semiprimes).

Original entry on oeis.org

1048576, 1572864, 2359296, 2621440, 3538944, 3670016, 3932160, 5308416, 5505024, 5767168, 5898240, 6553600, 6815744, 7962624, 8257536, 8650752, 8847360, 8912896, 9175040, 9830400, 9961472, 10223616, 11943936, 12058624

Offset: 1

Rick L. Shepherd, Mar 13 2002

nonn

Product of 20 not necessarily distinct primes.
Divisible by exactly 20 prime powers (not including 1).
Any 20-almost prime can be represented in several ways as a product of two 10-almost primes A046314; in several ways as a product of four 5-almost primes A014614; in several ways as a product of five 4-almost primes A014613; and in several ways as a product of ten semiprimes A001358. - Jonathan Vos Post, Dec 12 2004

D. W. Wilson, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Almost Prime.

Cf. A101637, A101638, A101605, A101606.

Sequences listing r-almost primes, that is, the n such that A001222(n) = r: A000040 (r = 1), A001358 (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), this sequence (r = 20). - Jason Kimberley, Oct 02 2011

Select[Range[2*9!,5*10! ],Plus@@Last/@FactorInteger[ # ]==20 &] (* Vladimir Joseph Stephan Orlovsky, Feb 26 2009 *)

k=20; start=2^k; finish=15000000; v=[]; for(n=start,finish, if(bigomega(n)==k,v=concat(v,n))); v \\ Depending upon the size of k and how many terms are needed, a much more efficient algorithm than the brute-force method above may be desirable. See additional comments in this section of A069280.

from math import isqrt, prod
from sympy import primerange, integer_nthroot, primepi
def A069281(n):
    def g(x,a,b,c,m): yield from (((d,) for d in enumerate(primerange(b,isqrt(x//c)+1),a)) if m==2 else (((a2,b2),)+d for a2,b2 in enumerate(primerange(b,integer_nthroot(x//c,m)[0]+1),a) for d in g(x,a2,b2,c*b2,m-1)))
    def f(x): return int(n-1+x-sum(primepi(x//prod(c[1] for c in a))-a[-1][0] for a in g(x,0,1,1,20)))
    kmin, kmax = 1,2
    while f(kmax) >= kmax:
        kmax <<= 1
    while True:
        kmid = kmax+kmin>>1
        if f(kmid) < kmid:
            kmax = kmid
        else:
            kmin = kmid
        if kmax-kmin <= 1:
            break
    return kmax # Chai Wah Wu, Aug 23 2024

Product p_i^e_i with Sum e_i = 20.

a(n) = A078840(20,n). - R. J. Mathar, Jan 30 2019

A069275 14-almost primes (generalization of semiprimes).

Original entry on oeis.org

16384, 24576, 36864, 40960, 55296, 57344, 61440, 82944, 86016, 90112, 92160, 102400, 106496, 124416, 129024, 135168, 138240, 139264, 143360, 153600, 155648, 159744, 186624, 188416, 193536, 200704, 202752, 207360, 208896, 215040, 225280

Offset: 1

Rick L. Shepherd, Mar 13 2002

nonn

Product of 14 not necessarily distinct primes.
Divisible by exactly 14 prime powers (not including 1).
Any 14-almost prime can be represented in several ways as a product of two 7-almost primes A046308; and in several ways as a product of seven semiprimes A001358. - Jonathan Vos Post, Dec 11 2004

D. W. Wilson, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Almost Prime.

Cf. A101637, A101638, A101605, A101606.

Sequences listing r-almost primes, that is, the n such that A001222(n) = r: A000040 (r = 1), A001358 (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), this sequence(r = 14), A069276 (r = 15), A069277 (r = 16), A069278 (r = 17), A069279 (r = 18), A069280 (r = 19), A069281 (r = 20). - Jason Kimberley, Oct 02 2011

Select[Range[50000], Plus @@ Last /@ FactorInteger[ # ] == 14 &] (* Vladimir Joseph Stephan Orlovsky, Apr 23 2008 *)

k=14; start=2^k; finish=240000; v=[]; for(n=start,finish, if(bigomega(n)==k,v=concat(v,n))); v

from math import isqrt, prod
from sympy import primerange, integer_nthroot, primepi
def A069275(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def g(x,a,b,c,m): yield from (((d,) for d in enumerate(primerange(b,isqrt(x//c)+1),a)) if m==2 else (((a2,b2),)+d for a2,b2 in enumerate(primerange(b,integer_nthroot(x//c,m)[0]+1),a) for d in g(x,a2,b2,c*b2,m-1)))
    def f(x): return int(n+x-sum(primepi(x//prod(c[1] for c in a))-a[-1][0] for a in g(x,0,1,1,14)))
    return bisection(f,n,n) # Chai Wah Wu, Nov 03 2024

Product p_i^e_i with Sum e_i = 14.

A069276 15-almost primes (generalization of semiprimes).

Original entry on oeis.org

32768, 49152, 73728, 81920, 110592, 114688, 122880, 165888, 172032, 180224, 184320, 204800, 212992, 248832, 258048, 270336, 276480, 278528, 286720, 307200, 311296, 319488, 373248, 376832, 387072, 401408, 405504, 414720, 417792, 430080

Offset: 1

Rick L. Shepherd, Mar 13 2002

nonn

Product of 15 not necessarily distinct primes.
Divisible by exactly 15 prime powers (not including 1).
Any 15-almost prime can be represented in several ways as a product of three 5-almost primes A014614, and in several ways as a product of five 3-almost primes A014612. - Jonathan Vos Post, Dec 11 2004

D. W. Wilson, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Almost Prime.

Cf. A101637, A101638, A101605, A101606.

Sequences listing r-almost primes, that is, the n such that A001222(n) = r: A000040 (r = 1), A001358 (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), this sequence (r = 15), A069277 (r = 16), A069278 (r = 17), A069279 (r = 18), A069280 (r = 19), A069281 (r = 20). - Jason Kimberley, Oct 02 2011

Select[Range[90000], Plus @@ Last /@ FactorInteger[ # ] == 15 &] (* Vladimir Joseph Stephan Orlovsky, Apr 23 2008 *)
Select[Range[450000],PrimeOmega[#]==15&] (* Harvey P. Dale, Aug 14 2019 *)

k=15; start=2^k; finish=500000; v=[]; for(n=start,finish, if(bigomega(n)==k,v=concat(v,n))); v

from math import isqrt, prod
from sympy import primerange, integer_nthroot, primepi
def A069276(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def g(x,a,b,c,m): yield from (((d,) for d in enumerate(primerange(b,isqrt(x//c)+1),a)) if m==2 else (((a2,b2),)+d for a2,b2 in enumerate(primerange(b,integer_nthroot(x//c,m)[0]+1),a) for d in g(x,a2,b2,c*b2,m-1)))
    def f(x): return int(n+x-sum(primepi(x//prod(c[1] for c in a))-a[-1][0] for a in g(x,0,1,1,15)))
    return bisection(f,n,n) # Chai Wah Wu, Nov 03 2024

Product p_i^e_i with Sum e_i = 15.

A069277 16-almost primes (generalization of semiprimes).

Original entry on oeis.org

65536, 98304, 147456, 163840, 221184, 229376, 245760, 331776, 344064, 360448, 368640, 409600, 425984, 497664, 516096, 540672, 552960, 557056, 573440, 614400, 622592, 638976, 746496, 753664, 774144, 802816, 811008, 829440, 835584, 860160

Offset: 1

Rick L. Shepherd, Mar 13 2002

Product of 16 not necessarily distinct primes.
Divisible by exactly 16 prime powers (not including 1).
Any 16-almost prime can be represented in several ways as a product of two 8-almost primes A046310; in several ways as a product of four 4-almost primes A014613; and in several ways as a product of eight semiprimes A001358. - Jonathan Vos Post, Dec 12 2004

D. W. Wilson, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Almost Prime.

Cf. A014610, A101637, A101638, A101605, A101606.

Sequences listing r-almost primes, that is, the n such that A001222(n) = r: A000040 (r = 1), A001358 (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), this sequence (r = 16), A069278 (r = 17), A069279 (r = 18), A069280 (r = 19), A069281 (r = 20). - Jason Kimberley, Oct 02 2011

Select[Range[300000], Plus @@ Last /@ FactorInteger[ # ] == 16 &] (* Vladimir Joseph Stephan Orlovsky, Apr 23 2008 *)
Select[Range[10^6],PrimeOmega[#]==16&] (* Harvey P. Dale, Jan 30 2015 *)

k=16; start=2^k; finish=1000000; v=[]; for(n=start,finish, if(bigomega(n)==k,v=concat(v,n))); v

from math import isqrt, prod
from sympy import primerange, integer_nthroot, primepi
def A069277(n):
    def g(x,a,b,c,m): yield from (((d,) for d in enumerate(primerange(b,isqrt(x//c)+1),a)) if m==2 else (((a2,b2),)+d for a2,b2 in enumerate(primerange(b,integer_nthroot(x//c,m)[0]+1),a) for d in g(x,a2,b2,c*b2,m-1)))
    def f(x): return int(n+x-sum(primepi(x//prod(c[1] for c in a))-a[-1][0] for a in g(x,0,1,1,16)))
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    return bisection(f) # Chai Wah Wu, Aug 31 2024

Product p_i^e_i with Sum e_i = 16.

A101637 a(n) = 1 if n is a 4-almost prime, that is a product of exactly four (not necessarily distinct) primes, 0 otherwise.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1

Offset: 1

Jonathan Vos Post, Dec 10 2004

Characteristic function of A014613.

See A101638 for the inverse Moebius transform of this sequence.

			a(100) = 1 because 100 = 2 * 2 * 5 * 5 is the product of exactly 4 primes and thus is a 4-almost prime.

Antti Karttunen, Table of n, a(n) for n = 1..65537
Eric Weisstein's World of Mathematics, Almost Prime.
Index entries for characteristic functions
Index entries for sequences computed from exponents in factorization of n

Cf. A101638, A014613, A000040, A001358, A014612, A014614.

Table[If[PrimeOmega[n]==4,1,0],{n,100}] (* Harvey P. Dale, Sep 13 2024 *)

a(n)=bigomega(n)==4 \\ Charles R Greathouse IV, Jan 31 2017

Name edited by Antti Karttunen, Oct 08 2017

cp's OEIS Frontend

A046310 Numbers that are divisible by exactly 8 primes counting multiplicity.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Python

Formula

A046314 Numbers that are divisible by exactly 10 primes with multiplicity.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A046312 Numbers that are divisible by exactly 9 primes with multiplicity.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A069273 12-almost primes (generalization of semiprimes).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A069279 Products of exactly 18 primes (generalization of semiprimes).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A069281 20-almost primes (generalization of semiprimes).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A069275 14-almost primes (generalization of semiprimes).

Views

Author

Keywords

Comments

Links