The generalized Binet formula, representation and sums of the generalized order-\(k\) Pell numbers (Q2372406): Difference between revisions

This paper derives several properties of the recurrence \(P_{n,i} = 2P_{n-1,i} + P_{n-2,i} + \cdots + P_{n-k,i}\) for \(n\geq1\) and \(1\leq i\leq k\) with the initial conditions \(P_{n,i}=\delta_{n-1,i}\) for \(-(k-1)\leq n\leq 0\), where \(\delta_{a,b}\) denotes the Kronecker symbol. When \(k=2\), this reduces to the usual Pell sequence \(P_n\) defined recursively by \(P_n = 2P_{n-1}+P_{n-2}\) (\(n\geq2\)) with the initial conditions \(P_n=n\) for \(n=0, 1\).