OFFSET
1,2
COMMENTS
Numbers with at most one 2 and no 3s or higher in their prime exponents. - Charles R Greathouse IV, Aug 25 2016
A disjoint union of A005117 and A060687. The asymptotic density of this sequence is (6/Pi^2) * (1 + Sum_{p prime} 1/(p*(p+1))) = A059956 * (1 + A179119) = A059956 + A271971 = 0.8086828238... - Amiram Eldar, Nov 07 2020
Numbers k such that 2*A325973(k) = A034448(k)+A048250(k) > A000203(k), or equally, numbers k for which A325973(k) > A325974(k). Proof: for squarefree numbers the left hand side = 2*sigma(k). For k in A060687, i.e., when k = p^2 * r, with r squarefree, A034448(k)+A048250(k) = (p^2 + 1)*sigma(r) + (p + 1)*sigma(r) = (p^2 + p + 2)*sigma(r) = sigma(k) + sigma(r) > sigma(k). But for p^e * r, e >= 3, A034448(k)+A048250(k) = (p^e + 1)*sigma(r) + (p + 1)*sigma(r) = (p^e + p + 2)*sigma(r) < sigma(p^e)*sigma(r) = sigma(k). Likewise if the powerful part of k contains at least two distinct prime factors, then also A034448(k)+A048250(k) < A000203(k). - Antti Karttunen, Oct 05 2025
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..5000
EXAMPLE
n = 420 = 2*2*3*5*7, 4 distinct prime factors, 24 divisors of which 16 are unitary and 8 are not; ud(n) > nud(n) and 2^(4+1) = 32 is larger than d, the number of divisors.
MATHEMATICA
Select[Range[500], 2^(1 + PrimeNu[#]) > DivisorSigma[0, #] &] (* G. C. Greubel, May 05 2017 *)
PROG
(PARI) is(n)=my(f=factor(n)[, 2], t); for(i=1, #f, if(f[i]>1, if(t||f[i]>2, return(0), t=1))); 1 \\ Charles R Greathouse IV, Sep 17 2015
(PARI) is(n)=n==1 || factorback(factor(n)[, 2])<3 \\ Charles R Greathouse IV, Aug 25 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved
