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 A228942 #17 Mar 08 2014 22:46:13 %S A228942 0,1,2,2,3,4,4,4,4,6,6,6,6,8,8,7,8,11,12,12,12,14,14,12,12,13,15,17, %T A228942 15,17,17,18,15,15,15,17,17,20,19,25,26,28,24,25,19,19,24,20,19,18 %N A228942 Number of decompositions of highly composite numbers (A002182) into unordered sums of two highly abundant numbers (A002093). %C A228942 Conjecture: this sequence is always positive, analogous to sequence A045917 for the strong Goldbach conjecture. - _Jaycob Coleman_, Sep 08 2013 %H A228942 Jaycob Coleman, <a href="/A228942/b228942.txt">Table of n, a(n) for n = 1..265</a> %e A228942 a(6)=4, since 24=4+20=6+18=8+16=12+12. %Y A228942 Cf. A045917. %K A228942 nonn %O A228942 1,3 %A A228942 _Jaycob Coleman_, Sep 08 2013