This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A055743 #14 May 13 2017 03:43:20 %S A055743 2,6,10,12,15,20,24,30,34,40,42,48,51,60,66,68,70,78,80,84,85,90,96, %T A055743 102,105,110,114,120,126,130,132,136,138,140,150,156,160,165,168,170, %U A055743 174,180,182,190,192,195,204,210,220,222,228,230,234,238,240,246,252 %N A055743 Phi(n) has fewer distinct prime divisors than n. %H A055743 Charles R Greathouse IV, <a href="/A055743/b055743.txt">Table of n, a(n) for n = 1..10000</a> %e A055743 n=996 has 3 distinct prime divisors, 2, 3, and 83, while phi(996) = 328 = 2*2*2*41 has only 2 distinct prime factors. %t A055743 Select[Range[100], PrimeNu[EulerPhi[#]] < PrimeNu[#] &] (* _G. C. Greubel_, May 13 2017 *) %o A055743 (PARI) is(n)=my(f=factor(n)); omega(eulerphi(f)) < #f~ \\ _Charles R Greathouse IV_, Mar 04 2017 %Y A055743 Cf. A001221, A000010, A055741, A055742. %K A055743 nonn %O A055743 1,1 %A A055743 _Labos Elemer_, Jul 11 2000