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) = n^(tau(n)/2) for n in A000469.
EXAMPLE
a(14) = 1*(1)*2*(-1)*7*(-1)*14*(1) = 14^2 = 196.
MAPLE
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
CROSSREFS
KEYWORD
sign
AUTHOR
Peter Luschny, Jul 22 2011
STATUS
approved
