Results 41 to 50 of about 189 (146)
k‐Step Sum and m‐Step Gap Fibonacci Sequence
For two given integers k, m, we introduce the k‐step sumand m‐step gap Fibonacci sequence by presenting a recurrence formula that generates the nth term as the sum of k successive previous terms starting the sum at the mth previous term. Known sequences, like Fibonacci, tribonacci, tetranacci, and Padovan sequences, are derived for specific values of k,
Maria Adam +4 more
wiley +1 more source
On the Fibonacci Tiling and its Modern Ramifications
Abstract In the last 30 years, the mathematical theory of aperiodic order has developed enormously. Many new tilings and properties have been discovered, few of which are covered or anticipated by the early papers and books. Here, we start from the well‐known Fibonacci chain to explain some of them, with pointers to various generalisations as well as ...
Michael Baake +2 more
wiley +1 more source
Circulant matrices play an important role in solving ordinary and partial differential equations. In this paper, by using the inverse factorization of polynomial of degree n, the explicit determinants of circulant and left circulant matrix involving Tribonacci numbers or generalized Lucas numbers are expressed in terms of Tribonacci numbers and ...
Juan Li +3 more
wiley +1 more source
Identities involving the tribonacci numbers squared via tiling with combs
The number of ways to tile an $n$-board (an $n\times1$ rectangular board) with $(\frac12,\frac12;1)$-, $(\frac12,\frac12;2)$-, and $(\frac12,\frac12;3)$-combs is $T_{n+2}^2$ where $T_n$ is the $n$th tribonacci number.
Allen, Michael A., Edwards, Kenneth
core
Binomial tribonacci sums [PDF]
Kunle Adegoke +2 more
doaj +1 more source
On Some New Sequence Spaces and Their Duals
In this study, we defined some new sequence spaces using regular Tribonacci matrix. We examined some properties of these spaces such as completeness, Schauder basis. We have identified α − , β−, and γ−duals of the newly created spaces.
Damla Barlak, Ömer Kişi
wiley +1 more source
Summing Formulas for Generalized Tribonacci Numbers
In this paper, closed forms of the summation formulas for generalized Tribonacci numbers are presented. Then, some previous results are recovered as particular cases of the present results. As special cases, we give summation formulas of Tribonacci, Tribonacci-Lucas, Padovan, Perrin, Narayana and some other third order linear recurrance sequences.
openaire +6 more sources
Some boundedness and convergence properties of generalized Fibonacci’s‐type recurrences and their associated iterated recurrence ratios between pairs of consecutive terms are discussed under a wide number of initial conditions. Also, a more general, so‐called (k, q) Fibonacci’s recurrence and the associated Fibonacci’s ratio recurrences are ...
Manuel De la Sen, V. Ravichandran
wiley +1 more source
The row first‐minus‐last right (RFMLR) circulant matrix and row last‐minus‐first left (RLMFL) circulant matrices are two special pattern matrices. By using the inverse factorization of polynomial, we give the exact formulae of determinants of the two pattern matrices involving Perrin, Padovan, Tribonacci, and the generalized Lucas sequences in terms of
Zhaolin Jiang +3 more
wiley +1 more source
Recently there is huge interest in graph theory and intensive study on computing integer powers of matrices. In this paper, we consider one type of directed graph. Then we obtain a general form of the adjacency matrices of the graph. By using the well‐known property which states the (i, j) entry of Am (A is adjacency matrix) is equal to the number of ...
Fatih Yılmaz +2 more
wiley +1 more source

