On the Dual δ − k − Fibonacci Numbers
Asian Research Journal of Mathematics · pp. 1–12 · Published 12 Jan 2019
10.9734/ARJOM/2019/45436Abstract
We define two integer sequences that depend on a parameter and that are related to each other by two recurrence relations. Then we find the Binet formula for the terms of these sequences and, by developing it, we will get an equivalent combinatorial formula. We show that each sequence follows the same relation of recurrence although they differ in the initial conditions. Later we show that these numbers are related to the k − Fibonacci numbers and we finish this section nding its generating functions. Finally, for certain particular values of δ we show that these numbers are related to the Chebyshev polynomials. This paper deals with a new concept of k − Fibonacci sequences linked to each other, so there is no literature on the subject. I hope that this article will be the starting point for other mathematicians that wish to investigate this topic.
Cited by 0
No indexed citations yet.
Related research
- Iterated Binomial Transforms of the k-Fibonacci Sequence — shares topic coverage
- Modeling Life Time Data by Generalized Weibull-generalized Exponential Distribution — shares topic coverage
- Matrix Representation of Bi-Periodic Jacobsthal Sequence — shares topic coverage
- A New Generalization of Jacobsthal Lucas Numbers (Bi-Periodic Jacobsthal Lucas Sequence) — shares topic coverage
Article metrics
Real usage data collected on this platform.
9
Page views
0
PDF downloads
0
Outbound clicks
0
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.