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 A068935 #13 Nov 24 2019 06:45:36
%S A068935 8,16,32,64,81,96,128,144,192,216,243,256,288,324,384,432,486,512,576,
%T A068935 640,648,729,768,864,972,1024,1152,1280,1296,1458,1536,1600,1728,1944,
%U A068935 2048,2187,2304,2560,2592,2916,3072,3200,3456,3584,3888,4000,4096,4374,4608
%N A068935 Numbers having the sum of distinct prime factors less than the sum of exponents in prime factorization, A008472(n) < A001222(n).
%H A068935 Amiram Eldar, <a href="/A068935/b068935.txt">Table of n, a(n) for n = 1..10000</a>
%e A068935 144 is included because 144 = 2^4 * 3^2 and 2+3 < 4+2.
%t A068935 okQ[n_]:=Module[{tfi=Transpose[FactorInteger[n]]},Total[First[tfi]]<Total[Last[tfi]]]
%t A068935 Select[Range[2500],okQ] (* _Harvey P. Dale_, Jan 17 2011 *)
%o A068935 (PARI) isok(n) = vecsum(factor(n)[,1]) < bigomega(n); \\ _Michel Marcus_, Apr 25 2016
%Y A068935 Cf. A068936, A054411, A068937, A068938.
%K A068935 nonn
%O A068935 1,1
%A A068935 _Reinhard Zumkeller_, Mar 08 2002
%E A068935 More terms from _Michel Marcus_, Apr 25 2016