Numbers with Integer Complexity Close to the Lower Bound

Harry Altman, Joshua Zelinsky

Define $|n|$ to be the complexity of $n$, the smallest number of 1's needed to write $n$ using an arbitrary combination of addition and multiplication. John Selfridge showed that $…