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 A152444 #8 Aug 26 2015 23:58:52
%S A152444 16,27,30,36,42,50,54,64,66,70,75,78,81,98,100,102,105,110,114,120,
%T A152444 125,130,135,138,140,144,147,150,154,162,165,168,170,174,175,182,186,
%U A152444 189,190,195,196,200,210,216,220,222,225,230,231,238,242,245,246,250,255
%N A152444 n is included if the largest proper divisor of n that is coprime to d(n) is a composite, where d(n) is the total number of divisors of n.
%C A152444 A152443(a(n)) is composite for all n.
%e A152444 There are 4 divisors of 27. These are 1,3,9,27. The proper divisors of 27 are therefore 1,3,9. The largest of these that is coprime to d(27) = 4 is 9. So a(27) = 9. (Note that in this case, the largest divisor of 27 coprime to 4 is 27, not 9.)
%t A152444 a = {}; For[n = 2, n < 1000, n++, b = Max[Select[Drop[Divisors[n], -1], GCD[DivisorSigma[0, n], # ] == 1 &]]; If[b > 1 && ! PrimeQ[b], AppendTo[a, n]]]; a (* _Stefan Steinerberger_, Dec 06 2008 *)
%Y A152444 Cf. A152442, A152443.
%K A152444 nonn
%O A152444 1,1
%A A152444 _Leroy Quet_, Dec 04 2008
%E A152444 Extended by _Ray Chandler_ and _Stefan Steinerberger_, Dec 05 2008