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

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, 17, 18, 19, 16, 17, 19, 18, 19, 18, 24, 20, 29, 28, 23, 24, 24, 26, 26, 23, 22

Offset

1,2

Comments

Conjecture: this sequence is always positive, analogous to sequence A202472 for strong Goldbach conjecture. - Jaycob Coleman, Sep 08 2013

Links

Jaycob Coleman, Table of n, a(n) for n = 1..265

Example

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

Crossrefs

Cf. A202472.

Sequence in context: A135304 A249037 A029111 * A213718 A092038 A269990

Adjacent sequences: A228941 A228942 A228943 * A228945 A228946 A228947

Keyword

nonn

Author

Jaycob Coleman, Sep 08 2013

Status

approved