Results 11 to 20 of about 123 (113)
On Partial Sum of Tribonacci Numbers [PDF]
We study the sumst(k,r)=∑i=0tTki+rofkstep apart Tribonacci numbers for any1≤r≤k. We prove thatst(k,r)satisfies certain Tribonacci rulest(k,r)=akst-1(k,r)+bkst-2(k,r)+st-3(k,r)+λwith integersak,bk,ck, andλ.
Eunmi Choi, Jiin Jo
openaire +4 more sources
Exact Determinants of Some Special Circulant Matrices Involving Four Kinds of Famous Numbers
Circulant matrix family is used for modeling many problems arising in solving various differential equations. The RSFPLR circulant matrices and RSLPFL circulant matrices are two special circulant matrices.
Xiaoyu Jiang, Kicheon Hong
doaj +2 more sources
On New Banach Sequence Spaces Involving Leonardo Numbers and the Associated Mapping Ideal
In the present study, we have constructed new Banach sequence spaces ℓpL,c0L,cL, and ℓ∞L, where L=lv,k is a regular matrix defined by lv,k=lk/lv+2−v+2, 0≤k≤v,0, k>v, for all v, k = 0, 1, 2, ⋯, where l=lk is a sequence of Leonardo numbers. We study their topological and inclusion relations and construct Schauder bases of the sequence spaces ℓpL,c0L, and
Taja Yaying +4 more
wiley +1 more source
Dold sequences, periodic points, and dynamics
Abstract In this survey we describe how the so‐called Dold congruence arises in topology, and how it relates to periodic point counting in dynamical systems.
Jakub Byszewski +2 more
wiley +1 more source
We use a new method of matrix decomposition for r‐circulant matrix to get the determinants of An = Circr(F1, F2, …, Fn) and Bn = Circr(L1, L2, …, Ln), where Fn is the Fibonacci numbers and Ln is the Lucas numbers. Based on these determinants and the nonsingular conditions, inverse matrices are derived.
Jiangming Ma +3 more
wiley +1 more source
Incomplete Tribonacci–Lucas Numbers and Polynomials [PDF]
In this paper, we define Tribonacci-Lucas polynomials and present Tribonacci-Lucas numbers and polynomials as a binomial sum. Then, we introduce incomplete Tribonacci-Lucas numbers and polynomials. In addition we derive recurrence relations, some properties and generating functions of these numbers and polynomials. Also, we find the generating function
Yilmaz, Nazmiye, Taskara, Necati
openaire +2 more sources
On square Tribonacci Lucas numbers
The Tribonacci-Lucas sequence {Sn}{Sn} is defined by the recurrence relation Sn+3=Sn+2+Sn+1+SnSn+3=Sn+2+Sn+1+Sn with S0=3, S1=1, S2=3.S0=3, S1=1, S2=3. In this note, we show that 11 is the only perfect square in Tribonacci-Lucas sequence for n≢1(mod32)n≢1(mod32) and n≢17(mod96).n≢17(mod96).
openaire +3 more sources
Repdigits as Sums of Four Tribonacci Numbers
In this paper, we show that 66666 is the largest repdigit expressible as the sum of four tribonacci numbers. We used Binet’s formula, Baker’s theory, and a reduction method during the proving procedure. We also used the periodic properties of tribonacci number modulo 9 to deal with three individual cases.
Yuetong Zhou +3 more
openaire +2 more sources
Research on splitting quaternions with generalized Tribonacci hybrid number components [PDF]
This paper introduces the Generalized Tribonacci Hybrid Split Quaternion (GTHSQ), a novel split quaternion with coefficients derived from generalized Tribonacci hybrid numbers.
Yanni Yang, Yong Deng
doaj +1 more source
On the Characteristic Polynomial of the Generalized k-Distance Tribonacci Sequences
In 2008, I. Włoch introduced a new generalization of Pell numbers. She used special initial conditions so that this sequence describes the total number of special families of subsets of the set of n integers.
Pavel Trojovský
doaj +1 more source

