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 A093770 #8 Jul 09 2020 04:34:57
%S A093770 10800,16200,18000,21168,31752,40500,43200,45000,49392,52272,67500,
%T A093770 72000,73008,78408,84672,98000,109512,111132,124848,137200,145800,
%U A093770 155952,172800,172872,187272,191664,197568,209088,228528,233928,242000
%N A093770 Non-perfect powers k for which q = A051903(k)/A051904(k) is an integer, A051904(k) > 1.
%H A093770 Amiram Eldar, <a href="/A093770/b093770.txt">Table of n, a(n) for n = 1..10000</a>
%F A093770 Solutions to integer values of q = A051903(x)/A051904(x), when A051904(x) > 1.
%t A093770 ffi[x_] :=Flatten[FactorInteger[x]] ep[x_] :=Table[Part[ffi[x], 2*w], {w, 1, lf[x]}] lf[x_] :=Length[FactorInteger[x]] Do[s1=Min[ep[n]];s2=Max[ep[n]]; If[ !Equal[s1, 1]&&IntegerQ[q=(s2/s1)]&& Equal[Union[Table[IntegerQ[Part[ep[n], j]/s1], {j, 1, lf[n]}]], {False, True}], Print[n]], {n, 2, 10000000}]
%Y A093770 Cf. A001597, A051903, A051904, A093769.
%K A093770 nonn
%O A093770 1,1
%A A093770 _Labos Elemer_, Apr 16 2004