Let n be a positive integer. Let a(n) denote the number of partitions of n of the form n=x1+x2+… where x1≤x2≤… and for every term xi in the sequence, xi+1 is a power of 2. Let b(n) denote the number of partitions of n of the form n=y1+y2+… where each yi is a positive integer and for all yi except the last one, 2⋅yi≤yi+1 holds. Prove that a(n)=b(n).