In this paper, we find all solutions to the Diophantine equation $F_n+F_m=2^a(F_r+F_s)$ , where $\{F_k\}_{k\ge 0}$ is the Fibonacci sequence. This paper continues and extends a previous work which investigated the powers of 2 which are sums of two Fibonacci numbers.