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 A055768 #13 Jul 14 2017 22:22:30
%S A055768 0,1,1,2,3,3,3,3,4,5,5,5,5,5,6,7,8,8,8,8,8,8,9,9,9,9,10,11,11,11,11,
%T A055768 11,11,11,12,12,12,12,13,14,15,15,16,16,16,16,16,16,17,17,17,17,17,17,
%U A055768 17,18,19,19,19,19,20,21,21,22,22,23,23,23,24,24,24,25,26,26,26,27,28,28
%N A055768 Number of distinct primes dividing phi of n-th primorial number.
%H A055768 Reinhard Zumkeller, <a href="/A055768/b055768.txt">Table of n, a(n) for n = 1..10000</a>
%F A055768 a(n) = A001221(A000010(A002110(n))) = A001221(A005867(n)).
%F A055768 a(n) < n. - _Charles R Greathouse IV_, Sep 02 2015
%e A055768 For primorials with 10, 100, or 1000 prime factors, their totients have only 5, 32 or 241 prime divisors, corresponding to a(10), a(100), and a(1000).
%t A055768 Table[PrimeNu@ EulerPhi[Product[Prime@ i, {i, n}]], {n, 78}] (* or *)
%t A055768 With[{nn = 78}, PrimeNu@ FoldList[LCM @@ {#1, #2} &, Prime@ Range@ nn - 1]] (* _Michael De Vlieger_, Jul 14 2017 *)
%o A055768 (Haskell)
%o A055768 a055768 = a001221 . a005867 -- _Reinhard Zumkeller_, May 01 2013
%o A055768 (PARI) a(n)=omega(lcm(apply(p->p-1, primes(n)))) \\ _Charles R Greathouse IV_, Sep 02 2015
%Y A055768 Cf. A002110, A000010, A001221, A055769.
%K A055768 nonn
%O A055768 1,4
%A A055768 _Labos Elemer_, Jul 12 2000