scientific article; zbMATH DE number 2020766

From MaRDI portal
Publication:4441102





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)].











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)