Sums of products of generalized Fibonacci and Lucas numbers (Q2341929)

The paper evaluates explicitly sums of the form \[ X_n^{(d)} =\sum_{k=0}^n \prod_{j=0}^{d-1} F_{tk+\lambda j}, \] where \(t,~\lambda\) are fixed positive integers with \(t\) even and \(\{F_k\}_{k\geq 0}\) is the sequence of Fibonacci numbers. The evaluations depend on the class of \(t\) modulo \(4\) and the class of \(d\) modulo \(2\). When \(t\equiv 0\pmod 4\) and \(d\) is even, then \[ X_n^{(d)}=\sum_{j=1}^{d/2} F_{2tn j+((d-1)\lambda+t))} a_{d,j}+c_1n+c_2, \] with \[ a_{d,j}=\frac{\varepsilon}{5^{d/2}} \binom{d}{d/2-j}_{F,\lambda}, \] where \[ \binom{d}{d/2-j}_{F,\lambda}=\frac{\prod_{j=1}^m F_{j\lambda}}{\prod_{j=1}^k F_{j\lambda} \prod_{j=1}^{m-k} F_{j\lambda}} \] and \(\varepsilon=(-1)^{d/2-j}\) or \((-1)^{(d/2-j)(d/2-j+1)/2}\) according to whether \(\lambda\) is even or odd. Their approach apply not only to Fibonacci numbers, but to Lucas sequences whose characteristic roots are quadratic units of norm \(-1\) (so, their characteristic equation is \(X^2-pX-1\)). The proofs consist expressing the product of \(d\) Fibonacci numbers to be summed in terms of \(q\)-notation, where \(q\) is the ratio of the two roots of the characteristic equation \(X^2-X-1\), and use elementary but clever algebraic manipulations together with the \(q\)-binomial identity (or Rothe's identity) in order to derive the desired identities.