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 A082055 #10 Jan 22 2020 20:08:52
%S A082055 1,1,2,1,2,2,2,1,1,2,2,2,2,6,2,1,2,3,2,2,2,2,2,2,1,6,2,2,2,2,2,1,2,2,
%T A082055 6,1,2,6,2,2,2,6,2,2,6,2,2,2,3,1,2,2,2,6,2,6,2,2,2,2,2,6,2,1,6,2,2,2,
%U A082055 2,6,2,3,2,6,2,2,6,6,2,2,1,2,2,2,2,6,2,10,2,6,2,2,2,2,6,2,2,3,6,1,2,2,2,6,6
%N A082055 Product of common prime-divisors (without multiplicity) of sigma(n) and phi(n).
%C A082055 The squarefree kernel of the greatest common divisor of sigma(n) and phi(n). - _Antti Karttunen_, Jan 22 2020
%H A082055 Antti Karttunen, <a href="/A082055/b082055.txt">Table of n, a(n) for n = 1..65537</a>
%F A082055 a(n) = A007947(A009223(n)). - _Antti Karttunen_, Jan 22 2020
%t A082055 ffi[x_] := Flatten[FactorInteger[x]] lf[x_] := Length[FactorInteger[x]] ba[x_] := Table[Part[ffi[x], 2*w-1], {w, 1, lf[x]}] Table[Apply[Times, Intersection[ba[EulerPhi[w]], ba[DivisorSigma[1, w]]]], {w, 1, 256}]
%o A082055 (PARI) A082055(n) = factorback(factorint(gcd(sigma(n), eulerphi(n)))[, 1]); \\ _Antti Karttunen_, Jan 22 2020
%Y A082055 Cf. A000203, A000010, A007947, A009223, A081396, A082054.
%K A082055 nonn
%O A082055 1,3
%A A082055 _Labos Elemer_, Apr 03 2003