This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A346087 #15 Jul 19 2021 01:25:08 %S A346087 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 A346087 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 A346087 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 A346087 a(n) = min(A071178(n), A329348(n)). %C A346087 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 A346087 Values 0..5 occur for the first time at n = 1, 2, 4, 108, 324, 9375. %H A346087 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a> %H A346087 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a> %H A346087 <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a> %F A346087 a(n) = min(A071178(n), A329348(n)). %F A346087 a(n) = A100995(A345941(n)). %F A346087 For all n >= 1, A006530(n)^a(n) = A345941(n). %o A346087 (PARI) %o A346087 A345941(n) = gcd(n,A329044(n)); %o A346087 A346087(n) = isprimepower(A345941(n)); \\ Rest of program given in A329044. %Y A346087 Cf. A006530, A100995, A071178, A324886, A329044, A329348, A345941, A346100. %K A346087 nonn %O A346087 1,4 %A A346087 _Antti Karttunen_, Jul 07 2021