Partition of Integer into Powers of 2 for Consecutive Integers

Theorem
Let $n \in \Z_{>0}$ be a (strictly) positive integer.

Let $\map b n$ denote the number of ways $n$ can be partitioned into (integer) powers of $2$.

Then:
 * $\map b {2 n} = \map b {2 n + 1}$