A162143 -id:A162143 - cp's OEIS frontend

A369209 Numbers whose number of divisors has the largest prime factor 3.

4, 9, 12, 18, 20, 25, 28, 32, 36, 44, 45, 49, 50, 52, 60, 63, 68, 72, 75, 76, 84, 90, 92, 96, 98, 99, 100, 108, 116, 117, 121, 124, 126, 132, 140, 147, 148, 150, 153, 156, 160, 164, 169, 171, 172, 175, 180, 188, 196, 198, 200, 204, 207, 212, 220, 224, 225, 228

Offset: 1

Amiram Eldar, Jan 16 2024

Subsequence of A059269 and first differs from it at n = 36: A059269(136) = 44 has 15 = 3 * 5 divisors and thus is not a term of this sequence.
Numbers k such that A000005(k) is in A065119.
Numbers k such that A071188(k) = 3.
Equals the complement of A354181, without the terms of A036537 (i.e., complement(A354181) \ A036537).
The asymptotic density of this sequence is Product_{p prime} (1-1/p) * (Sum_{k>=1} 1/p^(A003586(k)-1)) - A327839 = 0.26087647470200496716... .

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A000005, A003586, A006530, A036537, A065119, A336595, A071188, A211337, A211338, A327839, A354181.
Subsequence of A013929 and A059269.
Subsequences: A001248, A030627, A050997, A054753, A062503, A067259, A079395, A085986, A085987, A086975, A095990, A096156, A138032, A162143, A179643, A179645.

gpf[n_] := FactorInteger[n][[-1, 1]]; Select[Range[300], gpf[DivisorSigma[0, #]] == 3 &]

gpf(n) = if(n == 1, 1, vecmax(factor(n)[, 1]));
is(n) = gpf(numdiv(n)) == 3;

A382208 Numbers k for which pi(bigomega(k)) = omega(k).

Original entry on oeis.org

1, 4, 9, 12, 18, 20, 24, 25, 28, 36, 40, 44, 45, 49, 50, 52, 54, 56, 63, 68, 75, 76, 88, 92, 98, 99, 100, 104, 116, 117, 120, 121, 124, 135, 136, 147, 148, 152, 153, 164, 168, 169, 171, 172, 175, 180, 184, 188, 189, 196, 207, 212, 225, 232, 236, 240, 242, 244, 245

Offset: 1

Felix Huber, Mar 30 2025

nonn

Numbers k for which A000720(A001222(k)) = A001221(k).
Numbers k = p_1^e_1 * ... * p_j^e_j for which pi(Sum_{i=1..j} e_i) = j where pi = A000720.
Supersequence of A001248, A054753, A065036, A085986, A162143, A179643, A179644, A179693, A179700, A179704.

			240 = 2^4*3*5 is in the sequence because pi(Omega(240)) = pi(6) = 3 = omega(240).

Felix Huber, Table of n, a(n) for n = 1..10000

Cf. A000720, A001221, A001222, A001248, A046386, A054753, A065036, A085986, A162143, A179644, A179693, A179700, A179704.

with(NumberTheory):
A382208:=proc(n)
    option remember;
    local k;
    if n=1 then
        1
    else
        for k from procname(n-1)+1 do
            if pi(Omega(k))=Omega(k,distinct) then
                return k
            fi
        od
    fi;
end proc;
seq(A382208(n),n=1..59);
# second Maple program:
q:= n-> (l-> is(numtheory[pi](add(i[2], i=l))=nops(l)))(ifactors(n)[2]):
select(q, [$1..245])[];  # Alois P. Heinz, Apr 05 2025

Select[Range[250], PrimePi[PrimeOmega[#]] == PrimeNu[#] &] (* Amiram Eldar, Apr 05 2025 *)

isok(k) = primepi(bigomega(k)) == omega(k); \\ Michel Marcus, Apr 05 2025

a(1) inserted by Michel Marcus, Apr 05 2025

cp's OEIS Frontend

A369209 Numbers whose number of divisors has the largest prime factor 3.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI