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 A329858 #13 Dec 04 2019 09:59:16
%S A329858 1,6,24,60,90,180,360,378,816,1056,1512,3780,9100,10500,12240,13230,
%T A329858 15750,15840,26460,31500,36750,40950,46494,51408,52920,63000,63700,
%U A329858 66528,73500,87360,94500,95550,110250,145600,145920,147000,163800,181632,185976,220500
%N A329858 Numbers k such that k and usigma(k) have the same set of prime divisors, where usigma(k) is the sum of unitary divisors of k (A034448).
%H A329858 Amiram Eldar, <a href="/A329858/b329858.txt">Table of n, a(n) for n = 1..435</a> (terms below 5*10^10)
%e A329858 6 is in the sequence since 6 = 2 * 3 and usigma(6) = 12 = 2^2 * 3 both have the same set of prime divisors, {2, 3}.
%t A329858 rad[n_] := Times @@ (First@# & /@ FactorInteger@ n); usigma[1]=1; usigma[n_] := Times @@ (1 + Power @@@ FactorInteger[n]); Select[Range[2*10^5], rad[#] == rad[usigma[#]] &]
%Y A329858 The unitary version of A027598.
%Y A329858 Cf. A007947, A034448.
%K A329858 nonn
%O A329858 1,2
%A A329858 _Amiram Eldar_, Nov 22 2019