Induction · Hard problem

For $2^n \ge n^2$, a student writes the step $2^{k+1} = 2\cdot2^k \ge 2k^2 \ge (k + 1)^2$. The last inequality needs $k^2 \ge 2k + 1$. What is the LARGEST positive integer $k$ for which this fails?