OFFSET
1,3
MATHEMATICA
max = 200;
selNu = Select[Range[max], PrimeNu[#] == 1&]-1;
phiQ[m_] := Select[Range[m+1, 2*m*Product[1/(1-1/(k*Log[k])), {k, 2, DivisorSigma[0, m]}]], EulerPhi[#] == m&, 1] != {};
selPhi = Select[Range[max], phiQ];
Join[{0}, Union[selNu, selPhi]]
PROG
(PARI) list(lim)=my(P=1, q, v, u=List([0])); forprime(p=2, default(primelimit), if(eulerphi(P*=p)>=lim, q=p; break)); v=vecsort(vector(P/q*lim\eulerphi(P/q), k, eulerphi(k)), , 8); v=select(n->n<=lim, v); forprime(p=2, sqrtint(lim\1+1), P=p; while((P*=p) <= lim+1, listput(u, P-1))); vecsort(concat(v, Vec(u)), , 8) \\ Charles R Greathouse IV, Jan 08 2013
CROSSREFS
KEYWORD
nonn
AUTHOR
Jean-François Alcover, Jan 06 2013
EXTENSIONS
Edited by N. J. A. Sloane, Jan 06 2013
STATUS
approved