On the sum of powers of two consecutive Fibonacci numbers

Abstract

Let $(F_{n})_{n\geq 0}$ be the Fibonacci sequence given by $F_{n+2}=F_{n+1}+F_{n}$, for $n\geq 0$, where $F_{0}=0$ and $F_{1}=1$. In this note, we prove that if $s$ is an integer number such that $F_{n}^{s}+F_{n+1}^{s}$ is a Fibonacci number for all sufficiently large integer $n$, then $s=1$ or 2.