OFFSET
1,1
COMMENTS
Freiberg & Pomerance show that this sequence is infinite and a(n) << n^2 log^2 n.
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
Tristan Freiberg, Carl Pomerance, A note on square totients, arXiv:1410.8109 [math.NT], 2014.
PROG
(PARI) is(n)=issquare(eulerphi(n))&&bigomega(n)==2
(PARI) list(lim)=my(v=List()); forprime(p=2, sqrtint(lim\1), forprime(q=p+1, lim\p, if(issquare((p-1)*(q-1)), listput(v, p*q)))); Set(v)
CROSSREFS
KEYWORD
nonn
AUTHOR
Charles R Greathouse IV, Nov 19 2014
STATUS
approved