OFFSET
1,1
COMMENTS
Makowski proved that phi(k) + sigma(k) = k*d(k) if and only if k is a prime (see in Sivaramakrishnan,Chapter I, page 8, Theorem 3). In this more general case the right hand side is instead m*d(k), and this equation holds for all primes.
This sequence is infinite: if p == 1 (mod 3) is prime then p^2 is a term. - Amiram Eldar, Mar 25 2024
REFERENCES
R. Sivaramakrishnan, Classical Theory of Arithmetic Functions, Marcel Dekker, Inc., New York and Basel, 1989.
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
A. Makowski, Problem 339, Elemente der Mathematik, Vol. 13 (1958), p. 115; alternative link.
C. A. Nicol, Problem E 1674, The American Mathematical Monthly, Vol. 71, No. 3 (1964), p. 317; Another characterization of prime number, Solutions to Problem E 1674 by Martin J. Cohen and J. A. Fridy, ibid., Vol. 72, No. 2 (1965), pp. 186-187.
FORMULA
EXAMPLE
78 is a term since it has 8 divisors, phi(78) = 24, sigma(78) = 168, and 24 + 168 = 192 = 24 * 8.
MATHEMATICA
Select[Range[184], CompositeQ[#] && Divisible[(DivisorSigma[1, #] + EulerPhi[#]), DivisorSigma[0, #]] &] (* Jayanta Basu, Jul 12 2013 *)
PROG
(PARI) is(n)=my(f=factor(n)); (eulerphi(f)+sigma(f))%numdiv(f)==0 && !isprime(n) && n>1 \\ Charles R Greathouse IV, Mar 01 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Labos Elemer, Jun 27 2000
STATUS
approved