Results 61 to 70 of about 189 (146)
Matrix Sequences of Tribonacci and Tribonacci-Lucas Numbers
, 2018 In this paper, we define Tribonacci and Tribonacci-Lucas matrix sequences and investigate their properties.
openaire +3 more sources
Some identities constructed by means of the generating functıons of tribonacci and lucas numbers
, 2020 Birçok çalışmadan faydalanarak oluşturulan bu tez toplam dört bölümdür. Giriş bölümü olan ilk bölümde tezin başlığında yer alan Lucas ve Tribonacci sayı dizilerinin de bulunduğu özel sayı dizileri ile ilgili genel bilgiler ve bu özel sayı dizilerinin ...
Namlı, Esra
core
, 2018 We prove some identities for the squares of generalized Tribonacci numbers. Various summation identities involving these numbers are derived.
openaire +2 more sources
On the Norms of Geometric and Symmetric Geometric Circulant Matrices with the Tribonacci Number
, 2018 In this paper, we study the spectral norms of the geometric circulant matrices T-r* = Ctirc,*(T-0, T-1, . . . ,Tn-1) and the symmetric geometric circulant matrices STr* = SCirc(r)* (T-0, T-1, . . .
TUĞLU, NAİM, KIZILATEŞ, CAN
core +1 more source
Powers in a class of A-strict standard episturmian words
, 2007 This paper concerns a specific class of strict standard episturmian words whose directive words resemble those of characteristic Sturmian words. In particular, we explicitly determine all integer powers occurring in such infinite words, extending recent ...
Glen, Amy, Glen, A.
core +1 more source
On the intersection of two distinct $k$-generalized Fibonacci sequences [PDF]
, 2011 summary:Let $k\geq 2$ and define $F^{(k)}:=(F_n^{(k)})_{n\geq 0}$, the $k$-generalized Fibonacci sequence whose terms satisfy the recurrence relation $F_n^{(k)}=F_{n-1}^{(k)}+F_{n-2}^{(k)}+\cdots + F_{n-k}^{(k)}$, with initial conditions $0,0,\dots ,0,1$
Marques, Diego, Max A. Alekseyev
core +1 more source
Communications in Advanced Mathematical Sciences, 2019 In this review article, we study the recent investigations on the forms of solutions of systems difference equations and difference equations in terms of well-known integer sequences such as Fibonacci numbers, Padovan numbers.
İnci Okumuş, Yüksel Soykan
doaj
The numbers of repeated palindromes in the Fibonacci and Tribonacci words
Discrete Applied Mathematics, 2017 The Fibonacci word \(F\) is the fixed point beginning with \(a\) of the morphism \(\sigma(a)=ab\) and \(\sigma(b)=a\). Similarly, the Tribonacci word \(T\) is the fixed point beginning with \(a\) of the morphism \(\tau(a)=ab\), \(\tau(b)=ac\) and \(\tau(c)=a\). Let \(F[1, n]\) (resp. \(T[1, n]\)) be the prefix of \(F\) (resp. \(T\)) of length \(n\).
Yuke Huang, Zhiying Wen
openaire +1 more source
Generalized sequences and k-independent sets in graphs
, 2010 In this paper we give a generalization of known sequences and then we give their graph representations. We generalize Fibonacci numbers, Lucas numbers, Pell numbers, Tribonacci numbers and we prove that they are equal to the total number of k-independent
Iwona Włoch +3 more
core +1 more source
Multiset rewriting over Fibonacci and Tribonacci numbers
Journal of Computer and System Sciences, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources