new sequence

[Joseph Biberstine]

No more up to 10^6; I doubt there are more.

Select[Range[10^6], EulerPhi[#] + DivisorSigma[1, #] == (Times @@ (First
/@ FactorInteger[#]))^2 &]

-JRB

Tanya Khovanova wrote:
> Hello seqfans,
> 
> I am trying to build a new sequence: Numbers n such that (phi(n) + sigma(n))=(rad(n))^2, where rad(n) is the product of distinct prime divisors.
> 
> I got only two numbers 2 and 588. Can anyone prove that 588 is the largest or find more?
> 
> Best, Tanya
> 
> 
> ___________________________________________________________
> $0 Web Hosting with up to 200MB web space, 1000 MB Transfer
> 10 Personalized POP and Web E-mail Accounts, and much more.
> Signup at www.doteasy.com
>