%I #7 Sep 02 2018 10:33:52

%S 30,60,70,90,105,120,140,150,154,165,180,182,195,210,231,240,270,273,

%T 280,286,300,308,315,330,350,357,360,364,374,385,390,399,418,420,429,

%U 442,450,455,462,480,490,494,495,510,525,540,546,560,561,570,572,585,595

%N Numbers such that the greatest prime divisor is less than the product of the other distinct prime divisors.

%H R. J. Mathar, <a href="/A212666/b212666.txt">Table of n, a(n) for n = 1..10000</a>

%e 30 is in the sequence because 30 = 2*3*5 and 5 < 2 * 3 = 6.

%p with(numtheory):for n from 2 to 600 do:x:=factorset(n):m:=nops(x): p:=product( '

%p x[i] ', 'i'=1..m): q:=p/x[m]:if x[m] < q then printf(`%d, `,n):else fi:od:

%K nonn

%O 1,1

%A _Michel Lagneau_, May 23 2012