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 A344757 #10 Jun 30 2021 19:47:32
%S A344757 1,1,1,1,1,1,1,1,1,1,5,1,1,1,1,1,5,1,7,1,1,1,5,1,1,1,9,1,1,1,1,1,1,1,
%T A344757 1,1,1,1,7,1,1,1,13,8,1,1,5,1,7,1,15,1,5,1,9,1,1,1,31,1,1,10,1,1,1,1,
%U A344757 19,1,1,1,5,1,1,8,21,1,1,1,7,1,1,1,41,1,1,1,13,1,31,1,25,1,1,1,5,1,9,14,1,1,1,1,15
%N A344757 a(n) = A069359(n) / gcd(A003415(n), A069359(n)).
%H A344757 Antti Karttunen, <a href="/A344757/b344757.txt">Table of n, a(n) for n = 2..12012</a>
%H A344757 Antti Karttunen, <a href="/A344757/a344757.txt">Data supplement: n, a(n) computed for n = 2..65537</a>
%F A344757 a(n) = A069359(n) / A340070(n) = A069359(n) / gcd(A003415(n), A069359(n)).
%o A344757 (PARI)
%o A344757 A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
%o A344757 A069359(n) = (n*sumdiv(n, d, isprime(d)/d)); \\ From A069359
%o A344757 A344757(n) = { my(u=A069359(n)); (u/gcd(u,A003415(n))); };
%Y A344757 Cf. A003415, A069359, A340070, A344756.
%Y A344757 Cf. also A344697.
%K A344757 nonn
%O A344757 2,11
%A A344757 _Antti Karttunen_, May 28 2021