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 A112769 #31 Jun 25 2025 08:04:34
%S A112769 12,20,24,28,40,44,45,48,52,56,60,63,68,72,76,80,84,88,90,92,96,99,
%T A112769 104,112,116,117,120,124,126,132,135,136,140,144,148,152,153,156,160,
%U A112769 164,168,171,172,175,176,180,184,188,189,192,198,200,204,207,208,212,220
%N A112769 Numbers with more than one prime factor and, in the ordered factorization, at least one exponent is less than the previous exponent when read from left to right.
%C A112769 This sequence lists the integers x such that A085079(x) > x. - _Michel Marcus_, Jun 25 2025 and Jul 30 2015
%H A112769 Seiichi Manyama, <a href="/A112769/b112769.txt">Table of n, a(n) for n = 1..10000</a>
%e A112769 90 = 2^1 * 3^2 * 5^1 and 2 > 1, so 90 is in sequence.
%t A112769 mopfQ[n_]:=Module[{e=FactorInteger[n][[All,2]]},Length[e]>1&&Min[ Differences[ e]]<0]; Select[Range[300],mopfQ] (* _Harvey P. Dale_, May 30 2018 *)
%o A112769 (PARI) isok(n) = {f = factor(n)[,2]; if (#f > 1, for (k=2, #f, if (f[k] < f[k-1], return (1)););); return (0);} \\ _Michel Marcus_, Jul 30 2015
%Y A112769 Cf. A085079, A097318, A097319, A097320, A304678.
%K A112769 nonn
%O A112769 1,1
%A A112769 _Ray Chandler_, Sep 23 2005, based on a suggestion from _Leroy Quet_