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 A359419 #9 Jan 04 2023 01:31:11
%S A359419 12,60,84,120,132,156,240,420,660,780,840,924,1020,1050,1092,1140,
%T A359419 1320,1380,1428,1560,1596,1680,1716,1740,1860,1932,2040,2100,2220,
%U A359419 2244,2280,2436,2460,2508,2580,2604,2640,2652,2760,2820,2940,2964,3036,3108,3120,3180
%N A359419 Nonsquarefree numbers that are both phi-practical and unitary phi-practical.
%C A359419 The squarefree numbers (A005117) are excluded from this sequence since every squarefree phi-practical number is also a unitary phi-practical number.
%C A359419 The least odd term in this sequence is a(104) = 8085.
%H A359419 Amiram Eldar, <a href="/A359419/b359419.txt">Table of n, a(n) for n = 1..10000</a>
%t A359419 phiPracticalQ[n_] := If[n == 1, True, (lst = Sort @ EulerPhi @ Divisors[n]; ok = True; Do[If[lst[[m]] > Sum[lst[[l]], {l, 1, m - 1}] + 1, (ok = False; Break[])], {m, 1, Length[lst]}]; ok)];
%t A359419 uphi[n_] := If[n == 1, 1, (Times @@ (Table[#[[1]]^#[[2]] - 1, {1}] & /@ FactorInteger[n]))[[1]]];
%t A359419 uDivisors[n_] := Select[Divisors[n], GCD[#, n/#] == 1 &];
%t A359419 uPhiPracticalQ[n_] := If[n < 1, False, If[n == 1, True, (lst = Sort@Map[uphi, uDivisors[n]]; ok = True; Do[If[lst[[m]] > Sum[lst[[l]], {l, 1, m - 1}] + 1, (ok = False; Break[])], {m, 1, Length[lst]}]; ok)]]; (* _Frank M Jackson_'s code at A260653 *)
%t A359419 Select[Range[3200], ! SquareFreeQ[#] && phiPracticalQ[#] && uPhiPracticalQ[#] &]
%Y A359419 Intersection of A013929, A260653 and A286906.
%Y A359419 Cf. A005117.
%K A359419 nonn
%O A359419 1,1
%A A359419 _Amiram Eldar_, Dec 31 2022