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 A105069 #27 Apr 14 2023 03:06:42
%S A105069 1,2,2,2,2,2,2,4,4,4,2,2,3,3,3,4,2,4,3,5,5,4,4,5,4,4,2,4,5,4,3,4,3,5,
%T A105069 5,3,5,5,4,4,5,5,2,3,6,4,4,8,4,4,6,3,4,6,6,5,6,5,5,3,3,7,8,5,5,3,3,5,
%U A105069 4,1,6,4,5,6,3,5,6,6,4,5,7,3,3,7,3,6,4,5,6,8,2,7,3,4,8,6,6,7,5,4,8,6,6,5,4,4,6,4,3,5,7
%N A105069 Number of distinct prime divisors of 100^n - 3.
%F A105069 a(n) = A001221(100^n-3).
%F A105069 a(n) = A105068(2*n). - _Amiram Eldar_, Jan 25 2020
%e A105069 If n = 1, then 100^1 - 3 = 97 which is prime so the first term is 1.
%p A105069 A105069 := proc(n) 100^n-3 ; numtheory[factorset](%) ; nops(%) ; end proc: # _R. J. Mathar_, Aug 24 2011
%t A105069 Table[PrimeNu[(100)^n - 3], {n, 1, 50}] (* _G. C. Greubel_, May 07 2017 *)
%Y A105069 Cf. A001221, A105068.
%K A105069 nonn
%O A105069 1,2
%A A105069 _Parthasarathy Nambi_, Apr 05 2005
%E A105069 a(31)-a(60) from _Amiram Eldar_, Jan 25 2020
%E A105069 a(61)-a(66) from _Jinyuan Wang_, Apr 01 2020
%E A105069 a(67)-a(111) from _Michael S. Branicky_, Apr 14 2023 using factorbd.com