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 A348038 #11 Oct 29 2021 09:05:45
%S A348038 1,1,1,3,1,1,1,9,4,1,1,3,1,1,1,27,1,4,1,3,1,1,1,9,6,1,16,3,1,1,1,81,1,
%T A348038 1,1,2,1,1,1,9,1,1,1,3,4,1,1,27,8,6,1,3,1,16,1,9,1,1,1,3,1,1,4,243,1,
%U A348038 1,1,3,1,1,1,3,1,1,6,3,1,1,1,27,64,1,1,3,1,1,1,9,1,4,1,3,1,1,1,81,1,8,4,9,1
%N A348038 a(n) = A003968(n) / gcd(n, A003968(n)), where A003968 is multiplicative with a(p^e) = p*(p+1)^(e-1).
%H A348038 Antti Karttunen, <a href="/A348038/b348038.txt">Table of n, a(n) for n = 1..20000</a>
%F A348038 a(n) = A003968(n) / A348036(n) = A003968(n) / gcd(n, A003968(n)).
%F A348038 a(n) = A327564(n) / A348039(n).
%t A348038 f[p_, e_] := p*(p + 1)^(e - 1); a[n_] := (m = Times @@ f @@@ FactorInteger[n]) / GCD[n, m]; Array[a, 100] (* _Amiram Eldar_, Oct 20 2021 *)
%o A348038 (PARI)
%o A348038 A003968(n) = {my(f=factor(n)); for (i=1, #f~, p= f[i, 1]; f[i, 1] = p*(p+1)^(f[i, 2]-1); f[i, 2] = 1); factorback(f); }
%o A348038 A348038(n) = { my(u=A003968(n)); (u/gcd(n, u)); };
%Y A348038 Differs from A327564 at the positions given by A347960.
%Y A348038 Cf. A003968, A005117 (positions of 1's), A327564, A348036, A348037, A348039.
%K A348038 nonn
%O A348038 1,4
%A A348038 _Antti Karttunen_, Oct 20 2021