OFFSET
1,5
COMMENTS
If the constraint on the number of divisors is dropped, one gets A000217 = triangular numbers n*(n+1)/2, which therefore is an upper bound.
If one considers 3-element subsets instead, one gets A241564; see the link there for the original motivation.
If one considers sums with more than 2 divisors, one gets A241566.
PROG
(PARI) a(n, m=2, d=3)={s=0; u=vector(m, n, 1)~; forvec(v=vector(m, i, [1, n]), numdiv(v*u)>d&&s++, 2); s}
CROSSREFS
KEYWORD
nonn
AUTHOR
M. F. Hasler, Apr 25 2014
STATUS
approved