OFFSET
1,1
COMMENTS
Except for p=2, the complement of A043297. Note that for primes p < 1000, we need to check for solutions x < 18478. The equation phi(x) = 2p has solutions for Sophie Germain primes, A005384
a(n) is also the primes p with 2p+1 or 4p+1 also prime, sequences A005384 and A023212. For the case 2p+1 a trivial solution is phi(6p+3)=4p, and for 4p+1, phi(4p+1)=4p. - Enrique Pérez Herrero, Aug 16 2011
LINKS
Enrique Pérez Herrero, Table of n, a(n) for n = 1..2000
Eric Weisstein's World of Mathematics, Totient Function
MATHEMATICA
t=Table[EulerPhi[n], {n, 3, 20000}]; Union[Select[t, Mod[ #, 4]==0&&PrimeQ[ #/4]&& #/4<1000&]/4] (* or *)
Select[Prime[Range[100]], PrimeQ[4#+1]||PrimeQ[2#+1]&] (* Enrique Pérez Herrero, Aug 16 2011 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
T. D. Noe, Oct 24 2003
STATUS
approved