ISSN : 1226-0657
In this work we study the tribonacci numbers. We find a tribonacci triangle which is an analog of Pascal triangle. We also investigate an efficient method to compute any <TEX>$n$</TEX>th tribonacci numbers by matrix method, and find periods of the sequence by taking modular tribonacci number.
(1986). Higher order Fibonacci sequence modulo M. Fibonacci Quarterly, 24(2), 138-139.
(1970). A Generalized Fibonacci sequence over an arbitrary ring. Fibonacci Quarterly, 8(2), 182-184.
(1989). On the periods of the Fibonacci sequence modulo M. Fibonacci Quarterly, 27(1), 11-13.
(2005). Fibonacci sequences in groups. Irish Math. Soc. Bulletin, 56, 81-85.
(1982). Generalized Fibonacci numbers by matrix method. Fibonacci Quarterly, 20(1), 73-76.
(2008). Tribonacci sequences with certain indices and their sums. Ars. Combinatorics, 86, 13-22.
(2013). Some double binomial sums related to Fibonacci, Pell and generalized ordered k-Fibonacci numbers. Rocky Mountain J. Math., 43(3), 975-987. 10.1216/RMJ-2013-43-3-975.
(1960). Fibonacci series modulo m. Amer. Math. Monthly, 67, 525-532. 10.2307/2309169.
(1986). Fibonacci sequences of period n in groups. Fibonacci Quarterly, 24(4), 356-361.