  We investigate the number $R_3(n)$ of representations of $n$ as the sum plus
the product of three positive integers. On average, $R_3(n)$ is
$\frac{1}{2}\log^2 n$. We give an upper bound for $R_3(n)$ and an upper bound
for the number of $n \leq N$ such that $R_3(n) = 0$. We conjecture that
$R_3(n)= 0$ infinitely often.
