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 A322320 #9 Dec 05 2018 17:23:55
%S A322320 1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,1,1,1,
%T A322320 1,2,1,1,1,4,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,1,3,1,1,1,1,2,
%U A322320 1,1,1,2,1,1,1,2,1,1,1,4,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,4,1
%N A322320 a(n) = gcd(A003557(n), A173557(n)).
%H A322320 Antti Karttunen, <a href="/A322320/b322320.txt">Table of n, a(n) for n = 1..20000</a>
%F A322320 a(n) = gcd(A003557(n), A173557(n)) = gcd(A322351(n), A322352(n)).
%F A322320 a(n) = A000010(n) / A322321(n).
%t A322320 a[n_] := If[n == 1, 1, Module[{f=FactorInteger[n]}, GCD[ Times@@ (First[#] ^(Last[#]-1)& /@ f), Times@@((#-1)& @@@ f)]]]; Array[a, 120] (* _Amiram Eldar_, Dec 05 2018 *)
%o A322320 (PARI)
%o A322320 A003557(n) = { my(f=factor(n)); for (i=1, #f~, f[i, 2] = f[i, 2]-1); factorback(f); }; \\ From A003557
%o A322320 A173557(n) = factorback(apply(p -> p-1, factor(n)[, 1]));
%o A322320 A322320(n) = gcd(A173557(n), A003557(n));
%Y A322320 Cf. A000010, A003557, A173557, A322321, A322351, A322352.
%Y A322320 Cf. also A066086, A322318.
%K A322320 nonn
%O A322320 1,12
%A A322320 _Antti Karttunen_, Dec 05 2018