The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A372599 Number of distinct prime factors of n^n-n. 2
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, 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, 10, 10, 7, 24, 7, 10, 20, 15, 13, 19, 6, 19, 11, 19, 9, 25, 6, 13 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,2
LINKS
FORMULA
a(n) = A001221(A061190(n)).
MATHEMATICA
a[n_] := a[n] = PrimeNu[n^n - n];
Table[a[n], {n, 2, 75}] (* Robert P. P. McKone, May 07 2024 *)
PROG
(PARI) a(n) = omega(n^n-n);
(Python)
from sympy.ntheory.factor_ import primenu
def A372599(n): return primenu(n*(n**(n-1)-1)) # Chai Wah Wu, May 07 2024
CROSSREFS
Sequence in context: A306574 A088527 A343400 * A030602 A133947 A082090
KEYWORD
nonn
AUTHOR
Tyler Busby, May 06 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 16 12:34 EDT 2024. Contains 373429 sequences. (Running on oeis4.)