Abstract
In this paper, the complex-type Narayana-Fibonacci numbers are defined. Additionally, we arrive at correlations between the complex-type Narayana-Fibonacci numbers and this generating matrix after deriving the generating matrix for these numbers. Eventually, we get their the Binet formula, the combinatorial, permanental, determinantal, exponential representations, and the sums by matrix methods are just a few examples of numerous features.
Reference25 articles.
1. Adams, W. and Shanks, D. (1982). Strong Primality Tests that are not sufficient. Mathematics of Computation, 36(159), 255-300.
2. Akuzum, Y. and Deveci, O. (2021). The arrowhead-Pell sequences. Ars Combinatoria, 155, 231-246.
3. Akuzum, Y. and Deveci, O. (2022). The Narayana-Fibonacci sequence and its Binet formulas. 6th International Congress on Life, Social, and Health Sciences in a Changing World, İstanbul, July 02-03, pp:303-307.
4. Becker, P.G. (1994). k-Regular power series and Mahler-type functional equations. Journal of Number Theory, 49(3), 269-286. Berzsenyi, G. (1975). Sums of products of generalized Fibonacci numbers. The Fibonacci Quarterly, 13(4), 43-344.
5. Brualdi, R.A. and Gibson, P.M. (1977). Convex polyhedra of doubly stochastic matrices I: applications of permanent function. Journal of Combinatorial Theory, Series A, 22 (2), 194-230. Chen, W.Y.C. and Louck, J.D. (1996). The combinatorial power of the companion matrix. Linear Algebra and its Applications, 232, 261-278.