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 A346095 #7 Jul 08 2021 14:22:21
%S A346095 1,1,1,1,1,1,1,3,5,1,1,1,1,1,1,9,1,25,1,1,1,1,1,5,49,1,1,1,1,7,1,1,1,
%T A346095 1,121,625,1,1,1,7,1,11,1,1,7,1,1,5,143,2401,1,1,1,1,169,1,1,1,1,343,
%U A346095 1,1,1331,1,17,1,1,1,1,161051,1,175,1,1,41503,1,169,1,1,49,35,1,1,121,19,1,1,1,1,49,24137569
%N A346095 a(n) = gcd(A324886(n), A064989(A324886(n))).
%H A346095 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A346095 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%H A346095 <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a>
%F A346095 a(n) = A330749(A324886(n)) = gcd(A324886(n), A329044(n)) = gcd(A324886(n), A064989(A324886(n))).
%F A346095 a(n) = A324886(n) / A346096(n).
%F A346095 a(n) = A329044(n) / A346097(n).
%F A346095 a(n) mod A006530(n) > 0, for all n > 1.
%o A346095 (PARI)
%o A346095 A330749(n) = {my(f); f = factor(n); if((n>1 && f[1, 1]==2), f[1, 2] = 0); for (i=1, #f~, f[i, 1] = precprime(f[i, 1]-1)); gcd(n, factorback(f)); };
%o A346095 A346095(n) = A330749(A324886(n)); \\ Rest of program given in A324886.
%Y A346095 Cf. A006530, A324886, A329044, A330749, A346096, A346097.
%K A346095 nonn
%O A346095 1,8
%A A346095 _Antti Karttunen_, Jul 07 2021