Results 31 to 40 of about 189 (146)
The Generalized Tribonacci Numbers with Negative Subscripts
See the abstract in the attached pdf.
Kantaphon Kuhapatanakul +1 more
openaire +4 more sources
On Third‐Order Linear Recurrent Functions
A function ψ:R→R is said to be a Tribonacci function with period p if ψ(x + 3p) = ψ(x + 2p) + ψ(x + p) + ψ(x), for all x∈R. In this paper, we present some properties on the Tribonacci functions with period p. We show that if ψ is a Tribonacci function with period p, then limx→∞(ψ(x + p)/ψ(x)) = β, where β is the root of the equation x3 − x2 − x − 1 = 0
Kodjo Essonana Magnani +1 more
wiley +1 more source
Generalized Tribonacci Function and Tribonacci Numbers
In the language of mathematics, sequence is considered to be list of numbers arranged in a particular way. A lot of sequences have been minutely studied till date. One of the most conspicuous among them is Fibonacci sequence. It is the sequence, which can be found by adding two previous terms, where the initial conditions are 0 and 1.
openaire +1 more source
Explicit Form of the Inverse Matrices of Tribonacci Circulant Type Matrices
It is a hot topic that circulant type matrices are applied to networks engineering. The determinants and inverses of Tribonacci circulant type matrices are discussed in the paper. Firstly, Tribonacci circulant type matrices are defined. In addition, we show the invertibility of Tribonacci circulant matrix and present the determinant and the inverse ...
Li Liu, Zhaolin Jiang, Zidong Wang
wiley +1 more source
Quadratic Approximation of Generalized Tribonacci Sequences
In this paper, we give quadratic approximation of generalized Tribonacci sequence {Vn}n≥0 defined by Vn = rVn−1 + sV n−2 + tV n−3 (n ≥ 3) and use this result to give the matrix form of the n-th power of a companion matrix of {Vn}n≥0. Then we re-prove the
Cerda-Morales Gamaliel
doaj +1 more source
Total Graph Interpretation of the Numbers of the Fibonacci Type
We give a total graph interpretation of the numbers of the Fibonacci type. This graph interpretation relates to an edge colouring by monochromatic paths in graphs. We will show that it works for almost all numbers of the Fibonacci type. Moreover, we give the lower bound and the upper bound for the number of all (A1, 2A1)‐edge colourings in trees.
Urszula Bednarz +3 more
wiley +1 more source
A note on generalized hybrid Tribonacci numbers
In this paper, we introduce the generalized hybrid Tribonacci numbers. These numbers can be considered as a generalization of the generalized complex Tribonacci, generalized hyperbolic Tribonacci and generalized dual Tribonacci numbers. We also obtain some identities for these numbers.
openaire +3 more sources
Relationship between some special number sequences
Bu tez 4 bölümden oluşmaktadır. Fibonacci sayıları ve Tribonacci sayıları arasında kurulmuş ilişkiler ele alınmış ve çeşitli özdeşliklere yer verilmiştir. Giriş bölümünde Fibonacci ve Tribonacci sayıları hakkında ön bilgiler verilmiştir.
Tutucu, Recep
core +1 more source
Integer Semigroups Associated with Dumont‐Thomas Numeration Systems
Given a primitive substitution, we define different binary operations on infinite subsets of the nonnegative integers. These binary operations are defined with the help of the Dumont‐Thomas numeration system; that is, a numeration system associated with the substitution. We give conditions for these semigroups to have an identity element.
Víctor F. Sirvent +5 more
wiley +1 more source
Computation of L⊙ in the Tribonacci base
The purpose of this paper is to study the quantities L⊕ (resp. L⊙) dened respectively as the maximal nite length of the -fractional part appearing when one adds (resp. multiplies) two β-integers.
Hbaib, Mohamed, Salah, Imen Ben
core

