%I #8 Jul 08 2017 09:48:27

%S 1,6,30,38,55,85,87,188,236,264,445,451,618,655,672,715,717,897,913,

%T 1221,1265,1357,1824,2095,2515,2765,3009,3247,3471,3605,3741,4088,

%U 4117,4237,5071,6747,7195,7689,7701,8120,10885,11577,12128,12245,12549

%N Numbers n such that sigma(n)=phi(n*omega(n)+1).

%C "Omega(n)" in the definition means the number of distinct prime factors of n, counted without multiplicity. This is implemented in Mathematica as PrimeNu[n] rather than as PrimeOmega[n]. - _Harvey P. Dale_, Jul 08 2017

%H Harvey P. Dale, <a href="/A067879/b067879.txt">Table of n, a(n) for n = 1..200</a>

%t Select[Range[13000],DivisorSigma[1,#]==EulerPhi[#*PrimeNu[#]+1]&] (* _Harvey P. Dale_, Jul 08 2017 *)

%K easy,nonn

%O 1,2

%A _Benoit Cloitre_, Mar 02 2002