Does Diophantine equation $1+n+n^2+\dots+n^k=2m^2$ have a solution for $n,k \geq 2$? When studying properties of perfect numbers (specifically this post), I ran into the Diophantine equation
$$
1+n+n^2+\dots+n^k=2m^2, n\geq 2, k \geq 2.
$$
Searching in range $n \leq 10^6$, $k \leq 10^2$ yields no solution. So I wonder if there are any solutions, and if not, is there some elementary reason for that? Or if it can be converted to some known open problem, that would do too...
Some thoughts: Of course if we allow $n=1$ or $k=1$ we could get trivial solutions. We can also see by mod $2$ that both $n$ and $k$ must be odd. Now we could try to solve some small cases such as $k=3$ or $k=5$... So set $k=3$ and try to solve $$1+n+n^2+n^3=2m^2.$$ Left side factors and hence we want to solve $(n+1)(n^2+1)=2m^2$. Now this imples $4 \mid 2m^2$ and so $m$ is even. Also we can see that $4 \nmid n^2+1$ for any integer $n$ (becase $n^2\equiv 0,1 \pmod 4 $). So all powers of $2$ in $2m^2$ except one will divide $n+1$. So let $m=2^t r$ with $2 \nmid r$,  then $2m^2=2^{2t+1}r^2$, $2^{2t} \mid n+1$, $2 \mid n^2+1$. So we can put $n=2^{2t}s-1$ with $2 \nmid s$, substitute it back, divide all powers of $2$ and we have the equation
$$
s(2^{4t-1}s^2-2^{2t}s+1)=r^2.
$$
Now the two expressions in the product are coprime, so they both have to be square, and that is farthest I got so far. Also the expression $2^{4t-1}s^2-2^{2t}s+1$ being square has a solution $s=15,t=2$, and I am yet to find another (but of course $s$ is not a square in this case so it does nothing for the original problem).

Here is an elementary proof that $1+n+n^2+n^3=2m^2$ has only integer solution $(n,m)=(-1,0)$. This is the minimal case referred in the general proof and this post gives an alternative without using the elliptic curves.
Since $(n+1)(n^2+1)=2m^2$ and gcd of the expressions on the left is $2$ (by parity argument $n$ must be odd, and $4 \nmid n^2+1$), we thus have $n^2+1$ either square of twice a square. It cannot be a square unless $n=0$ (which does not solve the original equation), hence $n^2+1=2a^2$, and so $n+1=b^2$. As $n$ is odd $b$ is even, say $b=2c$. Thus $n=4c^2-1$ and plugging to the previous equation we get $(4c^2-1)^2+1=2a^2$. However with some manipulation this can be written as:
$$
(2c^2-1)^2+(2c^2)^2=a^2.
$$
This is a primitive Pythagorean triple ($2c^2$ and $2c^2-1$ are coprime). It implies $2c^2=2\alpha \beta$, $2c^2-1=\alpha^2-\beta^2$ for some coprime integers $\alpha, \beta$. But then $c^2=\alpha \beta$ and $\alpha=\gamma^2$, $\beta=\delta^2$ for some integers $\gamma$, $\delta$. Plugging to the other equation we get $2\gamma^2 \delta^2-1=\gamma^4-\delta^4$. We rewrite this as $(\delta^2+\gamma^2)^2=2\gamma^4+1$, now we are ready to use the following lemma:
Lemma. Only integer solutions to $x^2=2y^4+1$ are $(x,y)=(\pm 1,0)$.
Proof. There is an elementary proof on this site already, see Integer solutions to $x^2=2y^4+1$.. It was also the Problem 4 on China IMO Team Selection Test in 1993, see this AoPS thread. Here is a proof based on ideas in linked posts/comments:

Clearly $y=0$ is a solution with $x=\pm 1$, so assume $y \neq 0$. Since $x$ is odd, put $x=2k+1$. The equation becomes $2k(k+1)=y^4$. Hence $y=2z$ and $k(k+1)=8z^4$. Since $\gcd(k,k+1)=1$, one of $k,k+1$ is fourth power and the other is $8$ times a fourth power.
If $k+1 = 8a^4, k = b^4$, then $b^4=8a^4-1 \equiv -1 \pmod 8$, impossible.
If $k+1 = b^4, k = 8a^4$, we can write $8a^4=(b^4-1)=(b^2-1)(b^2+1)$. Since $4 \nmid b^2+1$, it's clear that $\gcd(b^2-1,b^2+1) = 2$ and we have $a^4=\frac{b^2-1}{4} \frac{b^2+1}{2}$. Then $b^2-1=4t^2=(2t)^2$ and so $b=\pm 1$. But then $a=0$, impossible since $y \neq 0$.

So by the Lemma with $x=\delta^2+\gamma^2$ and $y=\gamma$, we have $\gamma=0$ and $\delta^2=1$. By a backwards substitution $\alpha=0, \beta=1$, then $c^2=0$ and finally $n=-1$ is the only solution (with $m=0$).
