(MAGMAMagma) [ k:k in [1..360]| EulerPhi(#Divisors(k)) eq #Divisors(&*PrimeDivisors(k)) ]; // Marius A. Burtea, Jul 09 2019
(MAGMAMagma) [ k:k in [1..360]| EulerPhi(#Divisors(k)) eq #Divisors(&*PrimeDivisors(k)) ]; // Marius A. Burtea, Jul 09 2019
editing
approved
editing
proposed
(MAGMA) [ k:k in [1..360]| EulerPhi(#Divisors(k)) eq #Divisors(&*PrimeDivisors(k)) ]; // Marius A. Burtea, Jul 09 2019
proposed
editing
editing
proposed
Wikipedia, <a href="http://en.wikipedia.org/wiki/Euler's_phi_function"> Euler's totient function</a>
Added punctuation to the examples - R. J. Mathar, Mar 05 2010
proposed
editing
editing
proposed
rad[n_] := Times @@ (First@# & /@ FactorInteger[n]); Select[Range[360], EulerPhi[ DivisorSigma[0, #] ] == DivisorSigma[0, rad[#]] &] (* Amiram Eldar, Jul 09 2019 *)
Numbers n k such that phi(tau(nk))= tau(rad(nk)) .
Amiram Eldar, <a href="/A173743/b173743.txt">Table of n, a(n) for n = 1..10000</a>
rad[n_] := Times @@ (First@# & /@ FactorInteger[n]); Select[Range[360], EulerPhi[ DivisorSigma[0, #] ] == DivisorSigma[0, rad[#]] &] (* Amiram Eldar, Jul 09 2019*)
approved
editing