No label defined (Q4441102)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2020766
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2020766 |
Statements
4 January 2004
0 references
binomial coefficients
0 references
Fibonacci number
0 references
identities
0 references
linear recurrence
0 references
0.794488787651062
0 references
0.7887061834335327
0 references
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)].
0 references
