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 A372599 #16 Oct 29 2024 03:42:16
%S A372599 1,2,3,4,4,5,4,6,5,6,5,9,5,6,12,8,4,10,5,11,7,6,7,12,8,13,8,10,6,14,8,
%T A372599 12,9,10,18,18,6,11,11,19,8,16,5,12,13,7,7,20,5,18,12,14,7,21,12,19,
%U A372599 10,10,7,24,7,10,20,15,13,19,6,19,11,19,9,25,6,13
%N A372599 Number of distinct prime factors of n^n-n.
%H A372599 Amiram Eldar, <a href="/A372599/b372599.txt">Table of n, a(n) for n = 2..115</a>
%F A372599 a(n) = A001221(A061190(n)).
%t A372599 a[n_] := a[n] = PrimeNu[n^n - n];
%t A372599 Table[a[n], {n, 2, 75}] (* _Robert P. P. McKone_, May 07 2024 *)
%o A372599 (PARI) a(n) = omega(n^n-n);
%o A372599 (Python)
%o A372599 from sympy.ntheory.factor_ import primenu
%o A372599 def A372599(n): return primenu(n*(n**(n-1)-1)) # _Chai Wah Wu_, May 07 2024
%Y A372599 Cf. A001221, A061190, A372546, A372229, A344870, A344869.
%K A372599 nonn
%O A372599 2,2
%A A372599 _Tyler Busby_, May 06 2024