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 A329859 #11 Dec 04 2019 10:00:57
%S A329859 1,12,36,168,240,504,702,720,1176,1200,1344,1404,1620,3528,3600,4032,
%T A329859 4050,6480,8100,9408,14880,19656,22680,23250,28080,28224,32400,44640,
%U A329859 46500,53460,63882,65280,69750,74400,113400,127764,132678,133650,137592,139500
%N A329859 Numbers k such that k and uphi(k) have the same set of prime divisors, where uphi is the unitary totient function (A047994).
%H A329859 Amiram Eldar, <a href="/A329859/b329859.txt">Table of n, a(n) for n = 1..1052</a> (terms below 5*10^10)
%e A329859 12 is in the sequence since 12 = 2^2 * 3 and uphi(12) = 6 = 2 * 3 both have the same set of prime divisors, {2, 3}.
%t A329859 rad[n_] := Times @@ (First@# & /@ FactorInteger@ n); uphi[1] = 1; uphi[n_] := Times @@ (-1 + Power @@@ FactorInteger[n]); Select[Range[10^5], rad[#] == rad[uphi[#]] &]
%Y A329859 The unitary version of A055744.
%Y A329859 Cf. A007947, A027598, A047994.
%K A329859 nonn
%O A329859 1,2
%A A329859 _Amiram Eldar_, Nov 22 2019