A346087 a(n) = min(A071178(n), A329348(n)).

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

Author

Antti Karttunen, Jul 07 2021

Keywords

• nonn

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.

Links

• Index entries for sequences computed from indices in prime factorization
• Index entries for sequences related to primorial base
• Index entries for sequences related to primorial numbers

Crossrefs

Cf. A006530, A100995, A071178, A324886, A329044, A329348, A345941, A346100.

Programs

PARI

A345941(n) = gcd(n,A329044(n));
A346087(n) = isprimepower(A345941(n)); \\ Rest of program given in A329044.

Formula

a(n) = min(A071178(n), A329348(n)).

a(n) = A100995(A345941(n)).

For all n >= 1, A006530(n)^a(n) = A345941(n).