A372546 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A372546

Number of distinct prime factors of n^n+n.

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

Table of n, a(n) for n=1..78.

FORMULA

a(n) = A001221(A066068(n)).

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