login
A346087
a(n) = min(A071178(n), A329348(n)).
3
0, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3
OFFSET
1,4
COMMENTS
Each term of A345941 is a power of the greatest prime factor of n, a(n) is the exponent of that term: a(n) = A100995(A345941(n)).
Values 0..5 occur for the first time at n = 1, 2, 4, 108, 324, 9375.
FORMULA
a(n) = min(A071178(n), A329348(n)).
a(n) = A100995(A345941(n)).
For all n >= 1, A006530(n)^a(n) = A345941(n).
PROG
(PARI)
A345941(n) = gcd(n, A329044(n));
A346087(n) = isprimepower(A345941(n)); \\ Rest of program given in A329044.
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jul 07 2021
STATUS
approved