Results 111 to 120 of about 2,057 (213)
Determinants of Toeplitz–Hessenberg Matrices with Generalized Leonardo Number Entries
Let un = un(k) denote the generalized Leonardo number defined recursively by un = un−1 + un−2 + k for n ≥ 2, where u0 = u1 = 1. Terms of the sequence un(1) are referred to simply as Leonardo numbers.
Goy Taras, Shattuck Mark
doaj +1 more source
We develop closed form expressions for various finite binomial Fibonacci and Lucas sums depending on the modulo 5 nature of the upper summation limit. Our expressions are inferred from some trigonometric identities.
Adegoke Kunle+2 more
doaj +1 more source
Some equalities and binomial sums about the generalized Fibonacci number $u_n$ [PDF]
Yücel Türker Ulutaş, Derya Toy
openalex +1 more source
The role of spreadsheets in an investigation of Fibonacci Numbers
We introduce a function Z(k) which measures the number of distinct ways in which a number can be expressed as the sum of Fibonacci numbers. Using a binary table and other devices, we explore the values that Z(k) can take and reveal a surprising ...
John E Baker, Steve Sugden
doaj
The Fibonacci Number of a Grid Graph and a New Class of Integer Sequences [PDF]
Reinhardt Euler
openalex
Continuous symmetry and chirality measures: approximate algorithms for large molecular structures. [PDF]
Alon G, Ben-Haim Y, Tuvi-Arad I.
europepmc +1 more source
Simulating the Hadamard gate in the Fibonacci disk code for universal topological quantum computation. [PDF]
Wu YS.
europepmc +1 more source
A fast Fibonacci wavelet-based numerical algorithm for the solution of HIV-infected CD4+T cells model. [PDF]
Vivek, Kumar M, Mishra SN.
europepmc +1 more source
Fibonacci index and stability number of graphs: a polyhedral study [PDF]
Véronique Bruyère, Hadrien Mélot
openalex +1 more source