On the arrowhead-Fibonacci numbers
From MaRDI portal
On the basis of the arrowhead matrix of the characteristic polynomial of the \(k\)-step Fibonacci sequence \(\{F_n^k\}\), where \[ F^k_{n+k}=F^k_{n+k-1}+F^k_{n+k-2}+\dots +F^k_{k}, \] for \(n \geq 0\), where \(F^k_0 = F^k_1 = \dots= F^k_{k-2} = 0\) and \(F^k_{k-1} = 1\), the concept of the arrowhead-Fibonacci number is introduced. Some properties of these numbers are studied. Their exponential representation is given. The arrowhead-Fibonacci numbers modulo \(m\) are defined and some of their properties are described.
Recommendations
Cites work
- k-Fibonacci sequences modulo m
- k-step Fibonacci sequence modulo m
- Arrowhead curves in a tree of Pythagorean triples
- Bivariate Fibonacci like \(p\)-polynomials
- Convex polyhedra of doubly stochastic matrices. I: Applications of the permanent function
- Fibonacci Series Modulo m
- scientific article; zbMATH DE number 3739656 (Why is no real title available?)
- scientific article; zbMATH DE number 607286 (Why is no real title available?)
- Incomplete Fibonacci and Lucas \(p\)-numbers
- Inertia characteristics of self-adjoint matrix polynomials
- On the Fibonacci and Lucas \(p\)-numbers, their sums, families of bipartite graphs and permanents of certain matrices
- On truncated Fibonacci sequences
- The combinatorial power of the companion matrix
- The cyclic groups via the Pascal matrices and the generalized Pascal matrices
- The Fibonacci-circulant sequences and their applications
- The Fibonacci-Padovan sequence and MacWilliams transform matrices
- The generalized Pell \((p, i)\)-numbers and their Binet formulas, combinatorial representations, sums
- The Jacobi-Perron algorithm and the algebra of recursive sequences
- The Pell-Padovan p-sequences and its applications
- Theory of Binet formulas for Fibonacci and Lucas p-numbers
Cited in
(3)
This page was built for publication: On the arrowhead-Fibonacci numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q504516)
