login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A372546
Number of distinct prime factors of n^n+n.
6
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, 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, 13, 6, 7, 16, 5, 14, 10, 7, 7, 15, 11, 7, 13, 7, 8, 16, 9, 13
OFFSET
1,2
LINKS
FORMULA
a(n) = A001221(A066068(n)).
MATHEMATICA
a[n_] := PrimeNu[n^n + n]; Array[a, 40] (* Amiram Eldar, Oct 29 2024 *)
PROG
(PARI) a(n) = omega(n^n+n);
(Python)
from sympy.ntheory.factor_ import primenu
def A372546(n): return primenu(n*(n**(n-1)+1)) # Chai Wah Wu, May 07 2024
KEYWORD
nonn
AUTHOR
Tyler Busby, May 06 2024
STATUS
approved