MathDB
2013 HMMT Guts #21: Summation of Powers of 3

Source:

March 26, 2013
HMMT

Problem Statement

Find the number of positive integers j32013j\leq 3^{2013} such that j=k=0m((1)k3ak)j=\sum_{k=0}^m\left((-1)^k\cdot 3^{a_k}\right) for some strictly increasing sequence of nonnegative integers {ak}\{a_k\}. For example, we may write 3=313=3^1 and 55=3033+3455=3^0-3^3+3^4, but 44 cannot be written in this form.