Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #21 Jun 24 2022 23:37:06
%S 12,24,40,45,48,56,63,80,96,112,135,144,160,175,176,189,192,208,224,
%T 275,288,297,320,325,351,352,384,405,416,425,448,459,475,513,539,544,
%U 567,575,576,608,621,637,640,675,704,720,736,768,800,832,833,864,875
%N Composite numbers m = Product p_i^{e_i} such that p_j^{e_j} > p_k^{e_k} for all p_j < p_k.
%H Lei Zhou, <a href="/A057715/b057715.txt">Table of n, a(n) for n = 1..10000</a>
%e 720 is included because 720 = 2^4 * 3^2 * 5^1 and 2^4 > 3^2 > 5^1.
%t Select[Range[575], Greater @@ Power @@@ (fi = FactorInteger[#]) && Length[fi] > 1 &] (* _Ray Chandler_, Nov 06 2008 *)
%K nonn,easy
%O 1,1
%A _Leroy Quet_, Oct 24 2000
%E Title clarified by _Sean A. Irvine_, Jun 24 2022