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 A119704 #40 May 13 2022 12:24:32
%S A119704 1,1,1,3,2,2,2,2,2,5,3,4,3,3,4,7,5,4,3,2,4,7,4,5,3,5,3,7,4,3,7,2,4,8,
%T A119704 4,5,6,4,3,9,4,3,7,4,4,12,4,4,9,4,7,8,4,2,6,9,5,6,5,4,6,3,3,11,3,6,8,
%U A119704 2,4,10,11,3,5,4,7,11,6,11,7,4,9,11,3,7,8,8,3,8,4,4,11,6,4,8,4,6,8,4
%N A119704 a(n) = number of distinct prime factors of 10^n+1 = omega(10^n+1).
%H A119704 Max Alekseyev, <a href="/A119704/b119704.txt">Table of n, a(n) for n = 0..331</a> [First 309 terms from Ray Chandler, from the Kamada link]
%H A119704 Makoto Kamada, <a href="https://stdkmd.net/nrr/repunit/10001.htm">Factorizations of 100...001</a>.
%F A119704 a(n) = A001221(A062397(n)). - _Ray Chandler_, May 02 2017
%e A119704 a(1) = number of distinct prime factors of 11 = 1.
%e A119704 a(3) = number of distinct prime factors of 1001 = 3.
%e A119704 a(11) = 4 because 10^11+1 = 11*11*23*4093*8779 has 4 distinct factors.
%t A119704 Table[Length[FactorInteger[10^n + 1]], {n, 0, 50}] (* _Stefan Steinerberger_, Jun 13 2006 *)
%t A119704 PrimeNu[10^Range[0,100]+1] (* The program will take some time to run *) (* _Harvey P. Dale_, Aug 27 2019 *)
%Y A119704 Cf. A001221, A003021, A038371, A057934, A062397.
%K A119704 nonn
%O A119704 0,4
%A A119704 _Lekraj Beedassy_, Jun 09 2006
%E A119704 More terms from _Don Reble_, Jun 13 2006