Results 71 to 80 of about 1,240,285 (142)
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 ...
Zhaolin Jiang, Nuo Shen, Juan Li
doaj +1 more source
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
Periodic words connected with the Tribonacci-Lucas numbers
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barabash, G., Kholyavka, Ya., Tytar, I.
openaire +2 more sources
Incomplete Tribonacci numbers and its determinants
Bu çalışmada, ilk olarak Tribonacci ve Tribonacci-Lucas sayıları üçlü bant matrislerin determinantları yardımıyla elde edildi. Daha sonra da, tamamlanmamış Tribonacci ve tamamlanmamış Tribonacci-Lucas sayıları tanımlandı. Tribonacci ailesinin genellemesi
Yılmaz, Nazmiye
core
A search for Tribonacci-Wieferich primes [PDF]
summary:Such problems as the search for Wieferich primes or Wall-Sun-Sun primes are intensively studied and often discused at present.
Klaška, Jiří
core
Generalized Tribonacci Polynomials
In this paper, we investigate the generalized Tribonacci polynomials and we deal with, in detail, two special cases which we call them (r,s,t)-Tribonacci and (r,s,t)-Tribonacci-Lucas polynomials.
Yüksel Soykan
core +1 more source
A new graph labeling with Tribonacci, Fibonacci and Triangular numbers
In this paper, a new graph labeling technique using three sequences of numbers, namely Tribonacci, Fibonacci and Triangular is introduced. They are named as Tribo-Fibo-Triangular labeling and denoted as TF $$\Delta $$ Δ labeling.
Fredrick Ignatius, S. Kaspar
doaj +1 more source
The numbers of repeated palindromes in the Fibonacci and Tribonacci words
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
On some properties of k-circulant matrices with the generalized Pell-Padovan numbers
In this paper, we investigate the properties of the $k$-circulant matrix generated by the generalized Pell--Padovan numbers. We derive explicit formulas for the sum of entries, the maximum column sum norm ($\Vert \cdot \Vert _{1}$), the maximum row sum ...
Yüksel Soykan, Erkan Taşdemir
doaj +1 more source
On prime powers in linear recurrence sequences. [PDF]
Odjoumani J, Ziegler V.
europepmc +1 more source

