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 A093893 #10 Jul 25 2015 00:49:34
%S A093893 1,3,5,7,11,13,17,19,23,29,31,37,41,43,47,49,53,59,61,67,71,73,79,83,
%T A093893 87,89,91,97,101,103,107,109,113,121,127,131,133,137,139,149,151,157,
%U A093893 163,167,169,173,179,181,183,191,193,197,199,211,213,217,223,227,229,233
%N A093893 Numbers n such that every sum of two or more divisors is composite.
%C A093893 All terms are odd and very few are composite. Every odd prime is a trivial member.
%C A093893 Very few terms have more than four divisors. The smallest such term is 4753, which has six divisors: 1,7,49,97,679,4753. - Adam M. Kalman (mocha(AT)clarityconnect.com), Nov 11 2004
%t A093893 For[a:=3, a<=500, s =Divisors[a];n := 1;d := False; While[(n<=2^Length[s])\[And]( ["not" character]d), If[Length[NthSubset[n, s]]>=2, If[ !PrimeQ[Plus@@NthSubset[n, s]], n++, d:= True], n++ ]]; If[ ["not" character]d, Print[a]];a+=2]; (Kalman)
%t A093893 fQ[n_] := Union@ PrimeQ[Plus @@@ Subsets[ Divisors@n, {2, Infinity}]] == {False}; Select[ Range[3, 235, 2], fQ@# &] (* _Robert G. Wilson v_, May 25 2009 *)
%Y A093893 Cf. A093890, A093891, A093892, A093894.
%K A093893 nonn
%O A093893 1,2
%A A093893 _Amarnath Murthy_, Apr 23 2004
%E A093893 More terms from Adam M. Kalman (mocha(AT)clarityconnect.com), Nov 11 2004
%E A093893 a(1)=1 prepended by _Max Alekseyev_, Mar 31 2015