OFFSET
1,1
COMMENTS
Are there terms in this sequence that have more than 2 distinct prime factors?
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..204
MATHEMATICA
expPow2Q[n_] := AllTrue[FactorInteger[n][[;; , 2]], # == 2^IntegerExponent[#, 2] &]; s[1] = 1; s[n_] := s[n] = Module[{prod = Times @@ Array[s, n - 1], k = s[n - 1] + 1}, While[! expPow2Q[prod*k], k++]; k]; Select[Array[s, 1000], CompositeQ]
PROG
(PARI) ispow2(n) = if(n == 0, 1, n >> valuation(n, 2) == 1);
lista(pindmax) = {my(pmax = prime(pindmax), v = vector(pindmax), f, pind, prd); for(k = 2, pmax, f = factor(k); pind = apply(x -> primepi(x), f[, 1]); for(i = 1, #pind, v[pind[i]] += f[i, 2]); if(vecprod(apply(x -> ispow2(x), v)) > 0, if(!isprime(k), print1(k, ", ")), for(i = 1, #pind, v[pind[i]] -= f[i, 2]))); }
CROSSREFS
KEYWORD
nonn
AUTHOR
Amiram Eldar, Sep 24 2024
STATUS
approved