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 A212666 #7 Sep 02 2018 10:33:52 %S A212666 30,60,70,90,105,120,140,150,154,165,180,182,195,210,231,240,270,273, %T A212666 280,286,300,308,315,330,350,357,360,364,374,385,390,399,418,420,429, %U A212666 442,450,455,462,480,490,494,495,510,525,540,546,560,561,570,572,585,595 %N A212666 Numbers such that the greatest prime divisor is less than the product of the other distinct prime divisors. %H A212666 R. J. Mathar, <a href="/A212666/b212666.txt">Table of n, a(n) for n = 1..10000</a> %e A212666 30 is in the sequence because 30 = 2*3*5 and 5 < 2 * 3 = 6. %p A212666 with(numtheory):for n from 2 to 600 do:x:=factorset(n):m:=nops(x): p:=product( ' %p A212666 x[i] ', 'i'=1..m): q:=p/x[m]:if x[m] < q then printf(`%d, `,n):else fi:od: %K A212666 nonn %O A212666 1,1 %A A212666 _Michel Lagneau_, May 23 2012