OFFSET
1,1
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..5000 from Chai Wah Wu)
EXAMPLE
3 is in the sequence because phi(3) + tau(3) = 2 + 2 = 4^2.
9 is in the sequence because phi(9) + tau(9) = 6 + 3 = 3^2.
15 is not in the sequence because phi(15) + tau(15) = 8 + 4 = 12 = 2^2 * 3, which is not a perfect square.
MATHEMATICA
Select[Range[1000], IntegerQ[Sqrt[DivisorSigma[0, #] + EulerPhi[#]]] &] (* Amiram Eldar, Apr 27 2024 *)
PROG
(PARI) isok(n) = issquare(numdiv(n) + eulerphi(n)); \\ Michel Marcus, Jul 23 2014
(Python)
from sympy import totient, divisor_count
from gmpy2 import is_square
[n for n in range(1, 10**4) if is_square(int(divisor_count(n)+totient(n)))] # Chai Wah Wu, Aug 04 2014
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Muehlfeld, Jul 13 2014
STATUS
approved