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 A105080 #9 Feb 05 2023 17:03:06 %S A105080 2,2,2,4,4,2,3,4,4,5,4,5,4,4,4,4,5,3,5,4,5,3,4,8,4,3,6,5,5,3,7,5,3,5, %T A105080 1,4,6,5 %N A105080 Number of distinct prime divisors of 10000^n - 3. %H A105080 Makoto Kamada, <a href="https://stdkmd.net/nrr/9/99997.htm">Factorizations of 99...997</a>. %F A105080 A105080(n) = A105068(4n) = A105069(2n). - _Robert G. Wilson v_, Apr 08 2005 %e A105080 The number of distinct prime divisors of 10000^1 - 3 is 2, so the first term is 2. %t A105080 PrimeNu[#]&/@(10000^Range[10]-3) (* The program generates the first 10 terms of the sequence. *) (* _Harvey P. Dale_, Feb 05 2023 *) %Y A105080 Cf. A089675, A105068, A105069. %K A105080 nonn %O A105080 1,1 %A A105080 _Parthasarathy Nambi_, Apr 06 2005 %E A105080 More terms from _Robert G. Wilson v_, Apr 08 2005