login
A190902
a(n) = Product_{d|n} d*mu(n/d).
3
1, -2, -3, 0, -5, 36, -7, 0, 0, 100, -11, 0, -13, 196, 225, 0, -17, 0, -19, 0, 441, 484, -23, 0, 0, 676, 0, 0, -29, 810000, -31, 0, 1089, 1156, 1225, 0, -37, 1444, 1521, 0, -41, 3111696, -43, 0, 0, 2116, -47, 0, 0, 0, 2601, 0, -53, 0, 3025, 0, 3249, 3364, -59, 0, -61, 3844
OFFSET
1,2
COMMENTS
a(n) is the multiplicative equivalent to Euler's totient function, phi(n) = Sum_{d|n} d*mu(n/d).
a(n) is the determinant of the symmetric tau(n) X tau(n) matrix M(n) defined by M(n) = [sigma(d_i*d_j)], where d_i, d_j run through the divisors of n. - Ridouane Oudra, Apr 25 2026
FORMULA
a(n) = 0 iff n is not squarefree (A013929).
a(n) < 0 iff n is prime (A000040).
a(n) = -n iff n is prime.
From Ridouane Oudra, Apr 25 2026: (Start)
a(n) = A069158(n)*A007955(n).
a(n) = A069158(n)*A061537(n).
a(n) = n^(tau(n)/2) for n in A000469.
a(n) = (A076479(n)*n)^(tau(n)/2) for n in A005117. (End)
EXAMPLE
a(14) = 1*(1)*2*(-1)*7*(-1)*14*(1) = 14^2 = 196.
MAPLE
with(numtheory): A190902 := proc(n) local d; mul(d*mobius(n/d), d=divisors(n)) end:
# Alternative:
with(numtheory): A190902 := proc(n) if mobius(n)=0 then 0 elif isprime(n) then -n else n^(2^(nops(factorset(n))-1)) fi end:
MATHEMATICA
a[n_] := Product[d MoebiusMu[n/d], {d, Divisors[n]}];
Array[a, 62] (* Jean-François Alcover, Jun 24 2019 *)
(* Alternative: *)
a[n_]:=Det[Table[DivisorSigma[1, Part[d=Divisors[n], i]*Part[d, j]], {i, DivisorSigma[0, n]}, {j, DivisorSigma[0, n]}]]; Array[a, 62] (* Stefano Spezia, Apr 26 2026 *)
PROG
(PARI) a(n)={my(r=1); fordiv(n, d, r*=d*moebius(n/d)); return(r); }
(Python)
from sympy import mobius, primenu
def A190902(n): return 0 if not mobius(n) else 1 if n==1 else -n**(1<<m-1) if (m:=primenu(n))==1 else n**(1<<m-1) # Chai Wah Wu, Apr 25 2026
KEYWORD
sign
AUTHOR
Peter Luschny, Jul 22 2011
STATUS
approved