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 A332824 #7 Feb 25 2020 18:33:55
%S A332824 2,4,6,12,10,36,30,60,90,100,42,540,70,900,210,420,22,8100,66,2100,
%T A332824 3150,1764,330,18900,550,4900,2970,94500,770,44100,2310,4620,6930,484,
%U A332824 11550,4252500,130,4356,16170,115500,182,9922500,546,291060,242550,108900,2730,1455300,8190,302500,858,1131900,1430,8820900,19110
%N A332824 a(n) = Product_{d|n} A019565(phi(d)), where phi is Euler totient function A000010.
%H A332824 Antti Karttunen, <a href="/A332824/b332824.txt">Table of n, a(n) for n = 1..8192</a>
%F A332824 a(n) = Product_{d|n} A332825(d).
%F A332824 a(n) = A318834(n) * A332825(n).
%F A332824 A048675(a(n)) = n.
%F A332824 A097248(a(n)) = A019565(n).
%o A332824 (PARI)
%o A332824 A019565(n) = {my(j,v); factorback(Mat(vector(if(n, #n=vecextract(binary(n), "-1..1")), j, [prime(j), n[j]])~))}; \\ From A019565
%o A332824 A332824(n) = { my(m=1); fordiv(n,d,m *= A019565(eulerphi(d))); (m); };
%Y A332824 Cf. A000010, A019565, A097248, A318834, A332825, A332826, A332827.
%Y A332824 Cf. A048675 (a left inverse).
%K A332824 nonn
%O A332824 1,1
%A A332824 _Antti Karttunen_, Feb 25 2020