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 A322318 #9 Dec 05 2018 17:23:39
%S A322318 1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,3,1,2,1,1,1,4,1,1,1,2,1,1,1,1,1,1,
%T A322318 1,6,1,1,1,2,1,1,1,2,3,1,1,4,1,1,1,2,1,3,1,4,1,1,1,2,1,1,1,1,1,1,1,2,
%U A322318 1,1,1,12,1,1,1,2,1,1,1,2,1,1,1,2,1,1,1,4,1,3,1,2,1,1,1,4,1,1,3,2,1,1,1,2,1
%N A322318 a(n) = gcd(A003557(n), A048250(n)).
%H A322318 Antti Karttunen, <a href="/A322318/b322318.txt">Table of n, a(n) for n = 1..20000</a>
%F A322318 a(n) = gcd(A003557(n), A048250(n)).
%F A322318 a(n) = A001615(n) / A322319(n).
%t A322318 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 A322318 (PARI)
%o A322318 A003557(n) = { my(f=factor(n)); for(i=1, #f~, f[i, 2] = f[i, 2]-1); factorback(f); }; \\ From A003557
%o A322318 A048250(n) = factorback(apply(p -> p+1, factor(n)[, 1]));
%o A322318 A322318(n) = gcd(A048250(n), A003557(n));
%Y A322318 Cf. A001615, A003557, A048250, A322319.
%Y A322318 Cf. also A066086, A322320.
%K A322318 nonn
%O A322318 1,12
%A A322318 _Antti Karttunen_, Dec 05 2018