For a given set

of positive integers, a problem of Motzkin asks to
determine the maximal density

among sets of nonnegative
integers in which no two elements differ by an element of

. The
problem is completely settled when

, and some partial
results are known for several families of

when

. In 1985
Rabinowitz & Proulx provided a lower bound for

and conjectured that their bound was sharp. Liu & Zhu proved this
conjecture in 2004. For each

, we determine

, which is a lower bound for

, and conjecture this to be the exact value of

.