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 A347960 #10 Oct 20 2021 18:42:29
%S A347960 36,72,100,108,144,180,196,200,216,225,252,288,300,324,360,392,396,
%T A347960 400,432,450,468,484,500,504,540,576,588,600,612,648,675,676,684,700,
%U A347960 720,756,784,792,800,828,864,900,936,968,972,980,1000,1008,1044,1080,1089,1100,1116,1125,1152,1156,1176,1188,1200,1224,1260,1296
%N A347960 Numbers k for which A348036(k) > A007947(k).
%C A347960 Numbers k such that A348039(k) > 1.
%C A347960 Numbers k such that A348037(k) < A003557(k).
%C A347960 Numbers k such that A327564(k) > A348038(k).
%C A347960 Differs from A036785 and A338539 for the first time at n=20, where a(n) = 450, as A036785(20) = A338539(20) = 441 is not included in this sequence.
%t A347960 f[p_, e_] := p*(p + 1)^(e - 1); q[n_] := GCD[n, Times @@ f @@@ (fct = FactorInteger[n])] > Times @@ First /@ fct; Select[Range[1300], q] (* _Amiram Eldar_, Oct 20 2021 *)
%o A347960 (PARI)
%o A347960 A003968(n) = {my(f=factor(n)); for (i=1, #f~, p= f[i, 1]; f[i, 1] = p*(p+1)^(f[i, 2]-1); f[i, 2] = 1); factorback(f); }
%o A347960 A007947(n) = factorback(factorint(n)[, 1]);
%o A347960 A348036(n) = gcd(n, A003968(n));
%o A347960 isA347960(n) = (A348036(n)>A007947(n));
%Y A347960 Cf. A003557, A003959, A003968, A007947, A327564, A348036, A348037, A348038, A348039.
%K A347960 nonn
%O A347960 1,1
%A A347960 _Antti Karttunen_, Oct 19 2021