Results 51 to 60 of about 189 (146)
On the Problem of Pillai with Tribonacci Numbers and Powers of 3
Let (Tn)n ≥ 0 be the sequence of tribonacci numbers defined by T0 = 0, T1 = T2 = 1, and Tn+3 = Tn+2 + Tn+1 + Tn for all n ≥ 0. In this note, we find all integers c admitting at least two representations as a difference between a tribonacci number and a ...
Mahadi Ddamulira (7406918)
core +1 more source
Qualitative Analysis of Differential, Difference Equations, and Dynamic Equations on Time Scales
Abstract and Applied Analysis, Volume 2015, Issue 1, 2015.
Tongxing Li +5 more
wiley +1 more source
Balance and Abelian Complexity of the Tribonacci word
International audienceG.~Rauzy showed that the Tribonacci minimal subshift generated by the morphism $\tau:$ $0\mapsto 01,$ $1\mapsto 02$ and $2\mapsto 0$ is measure-theoretically conjugate to an exchange of three fractal domains on a compact set in ...
Luca Q. Zamboni +5 more
core +1 more source
Templates for the k-binomial complexity of the Tribonacci word
Consider the k-binomial equivalence: two finite words are equivalent if they share the same subwords of length at most k with the same multiplicities. With this relation, the k-binomial complexity of an infinite word x maps the integer n to the number of
Michel Rigo +5 more
core +1 more source
In this paper, we introduce a new operator defined in this paper, we give some new generating functions of binary products of Tribonacci and Tribonacci Lucas polynomials and special numbers.
Hind Merzouk +2 more
openaire +2 more sources
Networked Systems with Incomplete Information
Abstract and Applied Analysis, Volume 2015, Issue 1, 2015.
Zidong Wang +4 more
wiley +1 more source
On the 3-parameter generalized quaternions with generalized tribonacci numbers components [PDF]
In this paper, we aim to combine 3-parameter generalized quaternions (shortly 3PGQs), which are a general form of the quaternion algebra according to 3-parameters, and generalized Tribonacci number (shortly GTNs), which are also quite a big special ...
İşbilir, Zehra +2 more
core +1 more source
Bu tez beş bölümden oluşmaktadır. Birinci bölümde, Fibonacci ve Tribonacci sayıları ve polinomları konularında tez ile ilişkili yapılmış çalışmalara yer verildi. Tezde kullanılan yöntem ve teknikler ele alındı.
Arslan, Barış
core
Tribonacci numbers with indices in arithmetic progression and their sums [PDF]
In this paper, we give a recurrence relation for the Tribonacci numbers with indices in aritmetics progression, {Trn+s} for 0
Irmak, Nurettin, Alp, Murat
openaire +2 more sources
On Tribonacci numbers written as a product of three Fibonacci numbers
The present paper examines the following Diophantine equation: Tn = Fk · Fl · Fm where Tn is the n-th Tribonacci number and likewise Fk is the k-th Fibonacci number and so on as variables.
Ozkaya Zeynep Demirkol
doaj +1 more source

