  We prove a conjecture posted in the Online Encyclopedia of Integer Sequences,
namely that there are exactly five positive integers that can be written in
more than one way as the sum of a nonnegative power of 2 and a nonnegative
power of 3. The case for both powers being positive follows from a theorem of
Bennett. We use elementary methods to prove the case where zero exponents are
allowed.
