A228944 - OEIS

A228944

Number of ways to write highly composite numbers (A002182(n)) as the difference of two highly abundant numbers (A002093), both <= 2*A002182(n).

%I #11 Mar 08 2014 22:46:31

%S 1,2,2,3,4,4,4,5,6,6,6,6,7,7,8,10,12,13,13,14,14,11,11,13,15,16,15,17,

%T 17,18,19,16,17,19,18,19,18,24,20,29,28,23,24,24,26,26,23,22

%N Number of ways to write highly composite numbers (A002182(n)) as the difference of two highly abundant numbers (A002093), both <= 2*A002182(n).

%C Conjecture: this sequence is always positive, analogous to sequence A202472 for strong Goldbach conjecture. - _Jaycob Coleman_, Sep 08 2013

%H Jaycob Coleman, <a href="/A228944/b228944.txt">Table of n, a(n) for n = 1..265</a>

%e a(4)=3, since 6=12-6=10-4=8-2.

%Y Cf. A202472.

%K nonn

%O 1,2

%A _Jaycob Coleman_, Sep 08 2013