OFFSET
1,1
REFERENCES
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 840.
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
P. A. MacMahon, Divisors of numbers and their continuations in the theory of partitions, Proc. London Math. Soc., 19 (1921), 75-113.
W. Sierpinski, Number Of Divisors And Their Sum, Monogr. Matemat. 42 (1964) chapter IV
Wikipedia, Euler's totient function
EXAMPLE
MAPLE
with(numtheory): for n from 1 to 1800 do : t1:= ifactors(n)[2] : t2 :=sum(t1[i][1], i=1..nops(t1)):if tau(phi(n)) = phi(t2) then print (n): else fi : od :
MATHEMATICA
Select[Range[2, 700], DivisorSigma[0, EulerPhi[#]] == EulerPhi[Total[FactorInteger[#][[All, 1]]]] &]
(* Jean-François Alcover, May 19 2011 *)
PROG
(Magma) [m:m in [2..700]|#Divisors(EulerPhi(m)) eq EulerPhi(&+PrimeDivisors(m))]; // Marius A. Burtea, Jul 10 2019
(PARI) isok(n) = numdiv(eulerphi(n)) == eulerphi(vecsum(factor(n)[, 1])); \\ Michel Marcus, Jul 10 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
Michel Lagneau, Feb 16 2010
EXTENSIONS
Removed sopf acronym. Updated references and links - R. J. Mathar, Mar 10 2010
STATUS
approved