Find the number of positive integers j≤32013j \leq 3^{2013}j≤32013 such that j=∑k=0m((−1)k⋅3ak)j = \sum_{k=0}^{m} \left((-1)^k \cdot 3^{a_k}\right)j=∑k=0m((−1)k⋅3ak for some strictly increasing sequence of nonnegative integers {ak}\{a_k\}{ak}. For example, we may write 3=313 = 3^13=31 and 55=30−33+3455 = 3^0 - 3^3 + 3^455=30−33+34, but 4 cannot be written in this form.