login
A390957
The number of non-bi-unitary divisors of n.
2
0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 2, 0, 0, 0, 1, 0, 2, 0, 2, 0, 0, 0, 0, 1, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 2, 2, 0, 0, 2, 1, 2, 0, 2, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 2, 1, 0, 0, 0, 2, 0, 0, 0, 4, 0, 0, 2, 2, 0, 0, 0, 2, 1, 0, 0, 4, 0, 0, 0, 0
OFFSET
1,12
COMMENTS
A non-bi-unitary divisor d of n is a divisor d such that the greatest common unitary divisors of d and n/d is larger than 1.
The sum of these divisors is A319072(n).
LINKS
FORMULA
a(n) = A000005(n) - A286324(n).
a(n) = 0 if and only if n is an exponentially odd number (A268335).
Sum_{k=1..n} a(k) ~ (1-A)*n*(log(n) + 2*gamma - 1 - A*B/(1-A)), where gamma = A001620, A = A306071 and B = A306072.
MATHEMATICA
a[n_] := Module[{e = FactorInteger[n][[;; , 2]]}, Times @@ (e + 1) - Times @@ (If[OddQ[#], # + 1, #]& /@ e)]; a[1] = 0; Array[a, 100]
PROG
(PARI) a(n) = {my(e = factor(n)[, 2]); vecprod(apply(x -> x+1, e)) - vecprod(apply(x -> if(x % 2, x+1, x), e)); }
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Amiram Eldar, Nov 25 2025
STATUS
approved