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 A346098 #11 Dec 10 2023 17:19:01
%S A346098 1,2,3,4,5,9,7,3,5,25,11,81,13,49,15625,9,17,25,19,625,117649,121,23,
%T A346098 45,2401,169,21,2401,29,4375,31,10,1771561,289,14235529,625,37,361,
%U A346098 4826809,7,41,11,43,14641,16807,529,47,125,2093663,5764801,24137569,28561,53,441,20449,5764801,47045881,841,59,343,61,961,1331,100,396067447082177
%N A346098 a(n) = A064989(A346096(n)) = A064989(A319626(A324886(n))).
%H A346098 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A346098 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%H A346098 <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a>
%F A346098 a(n) = A064989(A346096(n)) = A064989(A319626(A324886(n))).
%o A346098 (PARI)
%o A346098 A064989(n) = { my(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)); factorback(f); };
%o A346098 A319626(n) = (n / gcd(n, A064989(n)));
%o A346098 A346098(n) = A064989(A319626(A324886(n))); \\ Rest of program given in A324886.
%Y A346098 Cf. A064989, A319626, A324886, A346095, A346096, A346097, A346099 [= gcd(n, a(n))].
%K A346098 nonn
%O A346098 1,2
%A A346098 _Antti Karttunen_, Jul 07 2021