|
%I #15 Jul 19 2021 01:25:08
%S 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,
%T 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,
%U 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
%N a(n) = min(A071178(n), A329348(n)).
%C 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)).
%C Values 0..5 occur for the first time at n = 1, 2, 4, 108, 324, 9375.
%H <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%H <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a>
%F a(n) = min(A071178(n), A329348(n)).
%F a(n) = A100995(A345941(n)).
%F For all n >= 1, A006530(n)^a(n) = A345941(n).
%o (PARI)
%o A345941(n) = gcd(n,A329044(n));
%o A346087(n) = isprimepower(A345941(n)); \\ Rest of program given in A329044.
%Y Cf. A006530, A100995, A071178, A324886, A329044, A329348, A345941, A346100.
%K nonn
%O 1,4
%A _Antti Karttunen_, Jul 07 2021
|
