Results 111 to 120 of about 1,240,285 (142)
Some of the next articles are maybe not open access.
Tribonacci numbers with two blocks of repdigits
Mathematica Slovaca, 2021AbstractThe Tribonacci sequence is a generalization of the Fibonacci sequence which starts with 0,0,1 and each term afterwards is the sum of the three preceding terms. Here, we show that the only Tribonacci numbers that are concatenations of two repdigits are 13,24,44,81.
Jhon Jairo Bravo Grijalba +1 more
exaly +3 more sources
Polynomials whose coefficients are generalized Tribonacci numbers
Applied Mathematics and Computation, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Toufik Mansour, Mark Shattuck 0001
openaire +2 more sources
Incomplete Tribonacci numbers and polynomials
J. Integer Seq., 2014Summary: We define the incomplete Tribonacci sequence of numbers and polynomials. We study recurrence relations, some properties of these numbers and polynomials, and the generating function of the incomplete Tribonacci numbers.
José Luis Ramírez, Víctor F. Sirvent
openaire +2 more sources
Reciprocal sums of the Tribonacci numbers
J. Integer Seq., 2016Summary: In this article, we consider infinite sums of the reciprocals of the Tribonacci numbers. Then, by applying the floor function to the reciprocals of these sums, we obtain a new identity involving the Tribonacci numbers. Further, we give the formulas for an alternating sum of the reciprocals of the Tribonacci numbers and a sum of reciprocal ...
Pornpawee Anantakitpaisal +1 more
openaire +2 more sources
Tribonacci numbers and the Brocard-Ramanujan equation
J. Integer Seq., 2016Summary: Let \((T_{n})_{n\geq 0}\) be the Tribonacci sequence defined by the recurrence \(T_{n+2} = T_{n} + T_{n+1}\), with \(T_{0} = 0\) and \(T_{1} = T_{2} = 1\). In this short note, we prove that there are no integer solutions \((u, m)\) to the Brocard-Ramanujan equation \(m! + 1 = u^{2}\) where \(u\) is a Tribonacci number.
Vinícius Facó, Diego Marques
openaire +2 more sources
A Tribonacci-like sequence of composite numbers
J. Integer Seq., 2017Summary: We find a new Tribonacci-like sequence of positive integers \(\langle x_0, x_1, x_2, \ldots \rangle\) given by \(x_n = x_{n-1} + x_{n-2} + x_{n-3}, n \geq 3\), and \(\mathrm{gcd}(x_0,x_1,x_2) = 1\) that contains no prime numbers. We show that the sequence with initial values \(x_0 = 151646890045, x_1 = 836564809606, x_2 = 942785024683\) is the
openaire +2 more sources
An Application of Tribonacci Numbers
The Fibonacci Quarterly, 1977Stanley Bezuszka, Lou D'Angelo
openaire +1 more source
Tribonacci Cordial Labeling of Graphs ()
Journal of Applied Mathematics and Physics, 2022Sarbari Mitra, Soumya Bhoumik
exaly
Enumerative properties and cube polynomials of Tribonacci cubes
Discrete Mathematics, 2020Hacène Belbachir
exaly

