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 A340366 #5 Jan 06 2021 17:48:50
%S A340366 1,1,1,1,1,1,1,1,1,1,1,1,1,1,5,1,1,1,1,1,27,1,1,1,1,1,1,1,1,5,1,1,45,
%T A340366 1,15,1,1,1,25,1,1,27,1,1,1,1,1,1,1,1,11,1,1,1,1,1,9,1,1,5,1,1,7,1,
%U A340366 125,45,1,1,27,15,1,1,1,1,49,1,27,25,1,1,1,1,1,27,1,1,25,1,1,1,3,1,243,1,7,1,1,1,35,1,1,11
%N A340366 a(n) = A324106(n) / gcd(A005940(n), A324106(n)), where A324106(n) is multiplicative with a(p^e) = A005940(p^e).
%H A340366 Antti Karttunen, <a href="/A340366/b340366.txt">Table of n, a(n) for n = 1..16384</a>
%F A340366 a(n) = A324106(n) / A340364(n) = A324106(n) / gcd(A005940(n), A324106(n)).
%o A340366 (PARI)
%o A340366 A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t };
%o A340366 A324106(n) = { my(f=factor(n)); prod(i=1, #f~, A005940(f[i,1]^f[i,2])); };
%o A340366 A340366(n) = { my(u=A324106(n)); (u / gcd(u, A005940(n))); };
%Y A340366 Cf. A005940, A324106, A340364, A340365.
%K A340366 nonn
%O A340366 1,15
%A A340366 _Antti Karttunen_, Jan 06 2021