Turing machine deciding $\{1^{2^n} : n \geq 0 \}$
Here is the idea:


Go over the entire input, crossing out every other 1 encountered.

Reject if the number of 1s encountered was odd but more than 1.

Accept if the number of 1s encountered was exactly 1.

Otherwise, go back to step 1.