On \(k\)-Fibonacci numbers of arithmetic indexes (Q1004174): Difference between revisions

For any integer number \(k \geq 1\), the \(k\)-th Fibonacci sequence, say \(\{F_{k,n} \}_{n \in \mathbb N}\) is defined recurrently by \[ F_{k,0} = 0, F_{k,1} = 1, {\text{ and }} F_{k,n+1} = kF_{k,n} + F_{k,n-1} {\text{ for }} n \geq 1. \] Some interesting properties of this sequence are formulated and proved, e.g. Lemma 3: \(F_{k,a(n+2)+r} = (F_{k,a-1} + F_{k,a+1})F_{k,a(n+1)+r} - (-1)^aF_{k,an+r}\). Theorem 4: The sum of the \(k\)-Fibonacci numbers of kind \(an+r\) is \[ \sum_{i=0}^n F_{k,ai+r} = \frac{F_{k,a(n+1)+r} - (-1)^aF_{k,an+r} - F_{k,r} - (-1)^rF_{k,a-r}}{F_{k,a+1} + F_{k,a-1} - (-1)^a - 1}. \] Theorem 7: The alternating sum of the \(k\)-Fibonacci numbers of order \(an+r\) is \[ \sum_{i=0}^n (-1)^iF_{k,ai+r} = \frac{(-1)^nF_{k,a(n+1)+r} + (-1)^{n+a}F_{k,an+r} + F_{k,r} + (-1)^{r-1}F_{k,a-r}}{F_{k,a+1} +F_{k,a-1} + (-1)^a + 1}. \] A series of corollaries of these equalities are given.