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 A372546 #34 Nov 03 2024 17:40:48 %S A372546 1,2,3,3,3,5,5,4,3,7,4,4,4,8,6,5,5,6,10,6,6,10,6,5,6,8,8,11,6,7,11,7, %T A372546 7,13,7,9,8,7,5,10,7,7,12,7,9,18,6,7,10,10,11,11,10,9,14,12,12,11,7,9, %U A372546 13,6,7,16,5,14,10,7,7,15,11,7,13,7,8,16,9,13 %N A372546 Number of distinct prime factors of n^n+n. %H A372546 Amiram Eldar, <a href="/A372546/b372546.txt">Table of n, a(n) for n = 1..116</a> %F A372546 a(n) = A001221(A066068(n)). %t A372546 a[n_] := PrimeNu[n^n + n]; Array[a, 40] (* _Amiram Eldar_, Oct 29 2024 *) %o A372546 (PARI) a(n) = omega(n^n+n); %o A372546 (Python) %o A372546 from sympy.ntheory.factor_ import primenu %o A372546 def A372546(n): return primenu(n*(n**(n-1)+1)) # _Chai Wah Wu_, May 07 2024 %Y A372546 Cf. A001221, A066068, A372599, A372228, A344870, A344869, A377671. %K A372546 nonn %O A372546 1,2 %A A372546 _Tyler Busby_, May 06 2024