Digits of powers of 2 in ternary numeral system

Source abstract

We study the digits of the powers of 2 in the ternary number system. We propose an algorithm for doubling numbers in ternary numeral system. Using this algorithm, we explain the appearance of “stairs” formed by 0s and 2s when the numbers $2^n (n=0,1,2, \ldots)$ are written vertically so that for example the last digits are forming one column, the second last digits are forming another column, and so forth. We use the patterns formed by the leftmost digits, and the patterns formed by the rightmost digits to prove that the sizes of these blocks of 0s and 2s are unbounded. We also study how this regularity changes when the digits are taken between the left end and the right end of the numbers.