On the sum of powers of terms of a linear recurrence sequence

Let (F _n ) _n??0 be the Fibonacci sequence given by F _n+2 = F _n+1 + F _n , for n ?? 0, where F ₀ = 0 and F ₁ = 1. There are several interesting identities involving this sequence such as F _n ² + F _n+1 ² = F _2n+1, for all n ?? 0. In a very recent paper, Marques and Togbé proved that if F _n ^s + F _n+1 ^s is a Fibonacci number for all sufficiently large n, then s = 1 or 2. In this paper, we will prove, in particular, that if (G _m ) _m is a linear recurrence sequence (under weak assumptions) and G _n ^s + ... + G _n+k ^s ?? (G _m ) _m , for infinitely many positive integers n, then s is bounded by an effectively computable constant depending only on k and the parameters of G _m .