cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Views

Author

Rick L. Shepherd, Mar 13 2002

Keywords

Comments

Product of 18 not necessarily distinct primes.
Divisible by exactly 18 prime powers (not including 1).

Crossrefs

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

Programs

  • Mathematica
    Select[Range[31*10^5],PrimeOmega[#]==18&] (* Harvey P. Dale, Apr 05 2015 *)
  • PARI
    k=18; start=2^k; finish=4000000; v=[]; for(n=start,finish, if(bigomega(n)==k,v=concat(v,n))); v
    
  • Python
    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

Formula

Product p_i^e_i with Sum e_i = 18.