scientific article; zbMATH DE number 2020766
Let \(F_n\) denote the \(n\)th Fibonacci number. It is known that \[ F_n= \sum_{k\in\mathbb{Z}} (-1)^k{n\choose [{1\over 2}(n+ 5k+ 2)]} \] and \[ F_{n+1}= \sum_{k\in\mathbb{Z}}(- 1)^k{n\choose [{1\over 2}(n+ 5k)]}. \] The aim of this paper is to put these identities into a general context. It is shown that the sequences \[ a(n,i,l,m,z)= \sum_{k\in\mathbb{Z}} {n\choose [{1\over m}(n+ ik+ l)]} \] satisfy a linear recurrence of order \(i\) with constant coefficients that can be computed. These results generalize results of \textit{G. E. Andrews} [Fibonacci Q. 7, 113--130 (1969; Zbl 0176.32202)].
- Sections and lacunary sums of linearly recurrent sequences
- Fibonacci series with several parameters
- Recurrences for alternating sums of powers of binomial coefficients
- Fibonacci-Zahlen, Gitterpunktwege und die Identitäten von Rogers-Ramanujan.
- Some Polynomially Recursive Sequences and Combinatorial Identities
- scientific article; zbMATH DE number 4160821 (Why is no real title available?)
- Proving identities involving products of recurrence sequences and binomial coefficients
- scientific article; zbMATH DE number 166131 (Why is no real title available?)
- Sums of products of binomial coefficients mod 2 and run length transforms of sequences
- Analytic connection between the Fibonacci sequence and diagonal sums of binomial coefficients
- scientific article; zbMATH DE number 3203891 (Why is no real title available?)
- scientific article; zbMATH DE number 7676358 (Why is no real title available?)
- Binomial sums involving second-order linearly recurrent sequences
- Recurrence relations for sums of binomial coefficients and some generalizations
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 Q4441102)