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 A194003 #18 Sep 08 2022 08:45:58
%S A194003 0,1,1,3,1,3,2,3,3,2,2,3,3,2,3,3,2,3,2,3,2,3,2,4,3,3,2,6,2,4,3,3,2,2,
%T A194003 2,4,3,3,2,4,6,3,2,2,4,3,3,2,3,3,2,2,2,2,3,3,2,5,2,3,2,4,4,4,3,6,2,5,
%U A194003 2,2,2,5,2,5,4,4,3,4,3,5,4,2,3,4,2,4
%N A194003 Number of prime factors of n^8 + 1, counted with multiplicity.
%C A194003 This is to A193330 as A002523(n) = n^4+1 is to A002522(n) = n^2 + 1, and as A060890(n) = n^8+1 is to A002522(n) = n^2 + 1. a(n) = 1 when n^8+1 is prime, iff n is in {1, 2, 4} unless there is a larger Fermat prime than 65537.
%H A194003 Amiram Eldar, <a href="/A194003/b194003.txt">Table of n, a(n) for n = 0..10000</a>
%F A194003 a(n) = A001222(A060890(n)) = bigomega(n^8+1) or Omega(n^8+1)
%e A194003 a(10) = 2 because 10^8 + 1 = 100000001 = 17 * 5882353 has 2 prime factors.
%e A194003 a(40) = 6 because 40^8 + 1 = 6553600000001 = 17^2 * 113 * 337 * 641 * 929 has 6 prime factors (with multiplicity) and is the smallest example not squarefree.
%t A194003 Join[{0}, Table[Total[Transpose[FactorInteger[n^8 + 1]][[2]]], {n, 50}]]
%t A194003 PrimeOmega[Range[0,90]^8+1] (* _Harvey P. Dale_, May 27 2018 *)
%o A194003 (PARI) a(n) = bigomega(n^8+1); \\ _Michel Marcus_, Feb 09 2020
%o A194003 (Magma) [0] cat [&+[p[2]: p in Factorization(n^8+1)]:n in [1..90]]; // _Marius A. Burtea_, Feb 09 2020
%Y A194003 Cf. A001222, A060890, A002523, A193432, A193562, A193929.
%K A194003 nonn,easy
%O A194003 0,4
%A A194003 _Jonathan Vos Post_, Aug 10 2011