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 A345943 #9 Jul 04 2021 18:31:13
%S A345943 1,1,1,1,1,3,1,3,5,5,1,27,1,7,3125,9,1,25,1,125,16807,11,1,45,2401,13,
%T A345943 7,343,1,4375,1,5,161051,17,99648703,5625,1,19,371293,7,1,11,1,1331,
%U A345943 16807,23,1,125,23030293,144120025,1419857,2197,1,49,224939,823543,2476099,29,1,8575,1,31,65219,25,396067447082177,285311670611
%N A345943 a(n) = A329044(n) / gcd(n, A329044(n)).
%H A345943 Antti Karttunen, <a href="/A345943/b345943.txt">Table of n, a(n) for n = 1..3550</a>
%H A345943 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A345943 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%H A345943 <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a>
%F A345943 a(n) = A329044(n) / A345941(n) = A329044(n) / gcd(n, A329044(n)).
%o A345943 (PARI) A345943(n) = { my(u=A329044(n)); (u / gcd(n, u)); }; \\ The rest of the program given in A329044.
%Y A345943 Cf. A108951, A324886, A329044, A345941, A345942.
%K A345943 nonn
%O A345943 1,6
%A A345943 _Antti Karttunen_, Jul 04 2021