OBM 2000 Problem 3

Define $f$ on the positive integers by $f(n) = k^2 + k + 1$ , where $n=2^k(2l+1)$ for some $k,l$ nonnegative integers. Find the smallest $n$ such that $f(1) + f(2) + ... + f(n) \geq 123456$ .