On a new type of distance Fibonacci numbers (Q2444562)

The Distance Fibonacci Numbers, defined by a part of the authors, are denoted by \(Fd(k, n)\) and defined recursively as follows: \[ Fd(k, n) = Fd(k, n-k+1) + Fd(k, n-k) \] for \(n \geq k \geq 2\), with initial conditions \(Fd(k, n) = 1\) for \(0 \leq n \leq k - 1\). In the paper, the concept of \((2, k)\)-distance Fibonacci numbers \(F_2(k, n)\) is introduced. They are defined recursively by the relation: \[ F_2(k, n) = F_2(k, n - 2) + F_2(k, n - k) \] for \(n \geq k \geq 2\), with initial conditions \(F_2(k, i) = 1\) for \(i = 0, 1, . . . , k - 1\). Some interesting properties of these numbers are formulated and proved, e.g., two representations of \(F_2(k, n)\) are given by { Theorem 4.} Let \(n \geq 2, k \geq 3\) be integers. Then \[ F_2(k, n) = \sum^{\lfloor \frac{n}{2} \rfloor}_{t = \lfloor \frac{n}{k} \rfloor} \sum^{\lfloor \frac{n-2t}{n-2} \rfloor}_{i = \lceil \frac{n-2t-1}{k-2} \rceil} \left(\begin{matrix} t \\ i \end{matrix}\right). \] \textbf{Theorem 5.} Let \(n \geq 2, k \geq 2\) be integers. Then \[ F_2(k, n) = \sum^{\lfloor \frac{n}{k} \rfloor}_{i=0} \left ( \begin{matrix} i + \lfloor \frac{n-ik}{2} \rfloor \\ i \end{matrix} \right ). \] As partial cases, a lot of identities with Fibonacci and Padovan numbers are obtained.