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 A340085 #11 Dec 29 2020 20:37:56
%S A340085 1,1,1,1,1,1,1,1,1,1,1,1,1,3,1,1,1,1,1,1,3,5,1,1,1,3,1,1,1,1,1,1,5,1,
%T A340085 3,1,1,9,3,1,1,3,1,5,1,11,1,1,3,1,1,1,1,1,5,3,9,7,1,1,1,15,3,1,3,1,1,
%U A340085 1,11,1,1,1,1,9,1,3,15,3,1,1,1,5,1,3,1,21,7,5,1,1,1,11,15,23,9,1,1,9,5,1,1,1,1,3,3
%N A340085 a(n) = A336466(n) / gcd(n-1, A336466(n)); Odd part of A340082(n).
%H A340085 Antti Karttunen, <a href="/A340085/b340085.txt">Table of n, a(n) for n = 1..8191</a>
%H A340085 Antti Karttunen, <a href="/A340085/a340085.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%F A340085 a(n) = A000265(A340082(n)).
%F A340085 a(n) = A336466(n) / A340084(n) = A336466(n) / gcd(n-1, A336466(n)).
%F A340085 For all n >= 0, a(A003961(A019565(n))) = a(A019565(2*n)) = A339901(n).
%t A340085 Array[#2/GCD[#1 - 1, #2] & @@ {#, Times @@ Map[If[# <= 2, 1, (# - 1)/2^IntegerExponent[# - 1, 2]] &, Flatten[ConstantArray[#1, #2] & @@@ FactorInteger[#]]]} &, 105] (* _Michael De Vlieger_, Dec 29 2020 *)
%o A340085 (PARI)
%o A340085 A000265(n) = (n>>valuation(n,2));
%o A340085 A336466(n) = { my(f=factor(n)); prod(k=1,#f~,if(2==f[k,1],1,(A000265(f[k,1]-1))^f[k,2])); };
%o A340085 A340085(n) = { my(u=A336466(n)); u/gcd(n-1, u); };
%Y A340085 Cf. A000265, A003958, A003961, A019565, A336466, A339901, A340082, A340084, A340086.
%Y A340085 Cf. also A160595.
%K A340085 nonn
%O A340085 1,14
%A A340085 _Antti Karttunen_, Dec 28 2020