MathDB

Let

f(n)

be the number of ways to write

n

as a sum of powers of

2

, where we keep track of the order of the summation. For example,

f(4)=6

because

4

can be written as

4

2+2

2+1+1

1+2+1

1+1+2

, and

1+1+1+1

. Find the smallest

n

greater than

2013

for which

f(n)

is odd.

Problem Statement