scientific article; zbMATH DE number 2123885

From MaRDI portal
Publication:4831372





Let a binary linear recurrence \(\{W_n\}\) be defined for \(n\geq 0\) by: \(W_0=a\), \(W_1=b\), \(W_n=pW_{n-1}+W_{n-2}\) for \(n\geq 2\) where \(a,b,p\) are arbitrary complex numbers such that \(p(p^2+2) (p^2 +4)\neq 0\). Let \(\Delta=p^2+4\). In particular, if \((a,b)=(0,1)\), let \(W_n =U_n\). Furthermore if \(p=1\), then \(W_n=F_n\) (the \(n\)th Fibonacci number). The author presents a total of 29 summation formulas, including: \[ \sum^{4j}_{n=4i+1}(-1)^{n(n+1)2}W_{2n}= \frac {\Delta} {\Delta-2}U_{4j-4i} W_{4j+4i+1}. \] The proofs are by induction.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4831372)