  We give conditions under which certain digit-restricted integer sets avoid
$k$-term arithmetic progressions. These sets are reasonably efficient to
compute and therefore enable large-scale search. We identify a set with no
arithmetic progression of four terms and with harmonic sum $4.43975$, which
improves an earlier "greedy" construction.
