Let $x$ be real, $n = \lfloor{x}\rfloor$, and for all integers $k \ge 0$ set
$A(k) = \left\lfloor{\frac{n+1}{2}}\right\rfloor + \left\lfloor{\frac{n+2}{4}}\right\rfloor + \cdots + \left\lfloor{\frac{n+2^k}{2^{k+1}}}\right\rfloor + \left\lfloor{\frac{n}{2^{k+1}}}\right\rfloor.$
Since $\left\lfloor{\frac{n}{2^{k+1}}}\right\rfloor$ is always an integer,
$\left\lfloor{\frac{n}{2^{k+1}}}\right\rfloor = \left\lfloor{\dfrac{\left\lfloor{\frac{n}{2^{k+1}}}\right\rfloor+1}{2}}\right\rfloor + \left\lfloor{\dfrac{\left\lfloor{\frac{n}{2^{k+1}}}\right\rfloor}{2}}\right\rfloor = \left\lfloor{\dfrac{\frac{n}{2^{k+1}}+1}{2}}\right\rfloor + \left\lfloor{\dfrac{\frac{n}{2^{k+1}}}{2}}\right\rfloor = \left\lfloor{\frac{n+2^{k+1}}{2^{k+2}}}\right\rfloor + \left\lfloor{\frac{n}{2^{k+2}}}\right\rfloor.$
Therefore $A(k+1) = A(k)$ for all $k$, i.e., $A(k)$ is constant. The value of the constant is
$A(0) = \left\lfloor{\frac{n+1}{2}}\right\rfloor + \left\lfloor{\frac{n}{2}}\right\rfloor = n$,
since $n$ is an integer. Thus $A(k) = n$ for all $k \ge 0$. Let $2^{k_0}$ is the highest power of $2$ not exceeding $n$. For all $k \ge k_0$, $\left\lfloor{n/2^{k+1}}\right\rfloor = 0$ and thus
$n = A(k) = \left\lfloor{\frac{n+1}{2}}\right\rfloor + \left\lfloor{\frac{n+2}{4}}\right\rfloor + \cdots + \left\lfloor{\frac{n+2^k}{2^{k+1}}}\right\rfloor.$
This shows that
$\sum_{k = 0}^\infty
\left\lfloor{\frac{n+2^k}{2^{k+1}}}\right\rfloor = n.$
Since for each $k \ge 0$,
$\left\lfloor{\frac{n+2^k}{2^{k+1}}}\right\rfloor =\left\lfloor{\frac{x+2^k}{2^{k+1}}}\right\rfloor$,
it is also the case that
$\sum_{k = 0}^\infty \left\lfloor{\frac{x+2^k}{2^{k+1}}}\right\rfloor = n.$