On the solutions of the Diophantine equation \((x-d)^2 +x^2 +(x+d)^2 =y^n\) for \(d\) a prime power (Q2238284)

Suppose that \(n\) is an integer with \(n\ge 2\). In this work, the author gives all solutions of the Diophantine equation \[ (x-d)^2+x^2+(x+d)^2=y^n,\quad x,y\in\mathbb{Z},\quad \gcd(x,y)=1,\,\,x\neq 0,\tag{1} \] where \(d=p^b\) with \(b\ge 0\), \(p\) a prime and \(p\le 10^4\). On the proofs, he uses elementary arguments of algebraic number theory and the primitive divisor theorem due to \textit{Yu. Bilu} et al. [J. Reine Angew. Math. 539, 75--122 (2001; Zbl 0995.11010)] which is based on existence of primitive divisors of Lehmer numbers. For the computations in this work, the mathematical software package \texttt{Sage} is used. In Table 1 of this work, the solution \((x,y,d,r,n) = (13,5,197,1,7)\) of (1) with \(p\le 10^4\) is omitted. This missing solution is covered by the new results in [\textit{M. H. Le} and \textit{G. Soydan}, ``On the power values of the sum of three squares in arithmetic progression'', Math. Commun. 27, No. 2, 137--150 (2022; Zbl 07640088)].