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