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 A340365 #6 Jan 06 2021 17:48:43
%S A340365 1,1,1,1,1,1,1,1,1,1,1,1,1,1,9,1,1,1,1,1,35,1,1,1,1,1,1,1,1,9,1,1,13,
%T A340365 1,11,1,1,1,21,1,1,35,1,1,5,1,1,1,1,1,49,1,1,1,3,1,49,1,1,9,1,1,27,1,
%U A340365 17,13,1,1,13,11,1,1,1,1,55,1,55,21,1,1,1,1,1,35,7,1,21,1,1,5,7,1,875,1,27,1,1,1,121
%N A340365 a(n) = A005940(n) / gcd(A005940(n), A324106(n)), where A324106(n) is multiplicative with a(p^e) = A005940(p^e).
%C A340365 It is conjectured that A070776 gives the positions of all ones after the initial one. If that holds, then for all i, j: a(i) = a(j) => A340363(i) = A340363(j).
%H A340365 Antti Karttunen, <a href="/A340365/b340365.txt">Table of n, a(n) for n = 1..16384</a>
%F A340365 a(n) = A005940(n) / A340364(n) = A005940(n) / gcd(A005940(n), A324106(n)).
%o A340365 (PARI)
%o A340365 A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t };
%o A340365 A324106(n) = { my(f=factor(n)); prod(i=1, #f~, A005940(f[i,1]^f[i,2])); };
%o A340365 A340365(n) = { my(t=A005940(n)); t / gcd(t, A324106(n)); };
%Y A340365 Cf. A005940, A070776, A324106, A340362, A340364, A340366.
%Y A340365 Cf. also A305800, A340363.
%K A340365 nonn
%O A340365 1,15
%A A340365 _Antti Karttunen_, Jan 06 2021