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 A331738 #11 Nov 24 2022 04:20:44
%S A331738 1,1,1,2,1,1,1,1,3,1,1,2,1,1,1,8,1,3,1,2,1,1,1,1,5,1,1,2,1,1,1,1,1,1,
%T A331738 1,6,1,1,1,1,1,1,1,2,3,1,1,8,7,5,1,2,1,1,1,1,1,1,1,2,1,1,3,8,1,1,1,2,
%U A331738 1,1,1,3,1,1,5,2,1,1,1,8,27,1,1,2,1,1,1,1,1,3,1,2,1,1,1,1,1,7,3,10,1,1,1,1,1
%N A331738 Multiplicative with a(p^e) = p^(e-A000265(e)), where A000265(x) gives the odd part of x.
%H A331738 Antti Karttunen, <a href="/A331738/b331738.txt">Table of n, a(n) for n = 1..20736</a>
%H A331738 Antti Karttunen, <a href="/A331738/a331738.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%F A331738 Multiplicative with a(p^e) = p^A331739(e).
%F A331738 a(n) = n / A331737(n).
%t A331738 f[p_, e_] := p^(e - e/2^IntegerExponent[e, 2]); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Nov 24 2022 *)
%o A331738 (PARI)
%o A331738 A000265(n) = (n>>valuation(n,2));
%o A331738 A331738(n) = { my(f = factor(n)); prod(k=1, #f~, f[k, 1]^(f[k, 2]-A000265(f[k, 2]))); };
%Y A331738 Cf. A000265, A331737, A331739.
%K A331738 nonn,mult
%O A331738 1,4
%A A331738 _Antti Karttunen_, Feb 02 2020