No label defined (Q4934920)

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 1394809
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1394809

      Statements

      0 references
      7 September 2000
      0 references
      identities
      0 references
      generalized Fibonacci sequence
      0 references
      generalized Lucas sequence
      0 references
      sieve formulas
      0 references
      Let \(F_n^{(n)}\) be the \(r\)th Fibonacci sequence defined by \[ F_0^{(r)}= 0, F_1^{(r)}= 1,\dots, F_j^{(r)}= 2^{j-2} (2\leq j\leq r-1); \quad F_n^{(r)}= \sum_{k=1}^r F_{n-k}^{(r)} (n\geq r). \] The following identity is proved: \[ F_n^{(r)}= \sum_{0\leq m\leq[(n-1)/(r+1)]} (-1)^m d(m+1, n-(r+1)m) \] where \(d(m,1)=1\), \(d(m,n)= \frac{2m+n-3}{n-1} \binom {m+n-3} {n-2}\cdot 2^{n-2}\) \((n\geq 2)\). For \(r=2\) this is due to \textit{P. Filipponi} [Fibonacci Q. 36, 63-65 (1998; Zbl 0911.11013)]. A similar formula for the \(r\)-Lucas sequence is proved, too.
      0 references

      Identifiers