  In this paper we consider the Diophantine equation \begin{align*}b^k
+\left(a+b\right)^k &+ \cdots + \left(a\left(x-1\right) + b\right)^k=\\ &=d^l +
\left(c+d\right)^l + \cdots + \left(c\left(y-1\right) + d\right)^l,
\end{align*} where $a,b,c,d,k,l$ are given integers. We prove that, under some
reasonable assumptions, this equation has only finitely many integer solutions.
