Let (Fnβ)nβ₯0β be the Fibonacci sequence given by
Fn+2β=Fn+1β+Fnβ, for nβ₯0, where F0β=0 and F1β=1. There are
several interesting identities involving this sequence such as
Fn2β+Fn+12β=F2n+1β, for all nβ₯0. Inspired by this naive identity,
in 2012, Chaves, Marques and Togb\'e proved that if (Gmβ)mβ is a linear
recurrence sequence (under weak assumptions) and Gnsβ+β―+Gn+ksββ(Gmβ)mβ, for infinitely many positive integers n, then s is bounded by an
effectively computable constant depending only on k and the parameters of
Gmβ. In this paper, we generalize this result, proving, in particular, that
if (Gmβ)mβ and (Hmβ)mβ are linear recurrence sequences (also under weak
assumptions), R(z)βC[z] is a monic polynomial, and Ο΅0βR(Gnβ)+Ο΅1βR(Gn+1β)+β―+Ο΅kβ1βR(Gn+kβ1β)+R(Gn+kβ) belongs to (Hmβ)mβ, for infinitely
many positive integers n, then the degree of R(z) is bounded by an
effectively computable constant depending only on the upper and lower bounds of
the Ο΅iβ's and the parameters of Gmβ (but surprisingly not on k)