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 A284787 #25 Apr 09 2017 13:40:01
%S A284787 30,36,42,48,50,54,58,60,64,66,70,72,74,76,78,80,82,84,86,88,90,92,94,
%T A284787 96,98,100,102,104,106,108,110,112,114,116,118,120,122,124,126,128,
%U A284787 130,132,134,136,138,140,142,144,146,148,150,152,154,156,158,160,162
%N A284787 Even numbers representable in at least two ways as the sum of two odd composites.
%C A284787 If n is even and n > 68, at least two of n-15, n-25, n-35, n-45, n-55, n-65, are odd numbers divisible by 3 and greater than 3, with n = (n-55) + 55 for example.
%C A284787 So if n is even and n > 68, then n can be written in at least two ways as the sum of two odd positive composite numbers.
%D A284787 D. Wells, The Penguin Dictionary of Curious and Interesting Numbers, 1997, page 111.
%H A284787 R. E. Ruemmler and Minnich, <a href="http://www.jstor.org/stable/2690953">Problem 1328: Sums of Composite Odd Numbers</a>, Mathematics Magazine, 63 (1990), 276.
%e A284787 30 = 9 + 21 = 15 + 15;
%e A284787 66 = 15 + 51 = 21 + 45.
%t A284787 up = 200; oddco = Select[Range[9, up, 2], ! PrimeQ[#] &]; Select[ Range[2, up, 2], Length@ Quiet@ IntegerPartitions[#, {2}, oddco, 2] == 2 &] (* _Giovanni Resta_, Apr 03 2017 *)
%Y A284787 Cf. A076770, A284788.
%K A284787 nonn
%O A284787 1,1
%A A284787 _Bernard Schott_, Apr 03 2017
%E A284787 a(42)-a(57) from _Giovanni Resta_, Apr 03 2017