Missing Terms Formula for Tribonacci-Like Sequences

G.P.S. Rathore, Omprakash Sikhwal, Ritu Choudhary

Abstract: Tribonacci sequences are generalization of Fibonacci sequences. Tribonacci sequence is defined by Tn=Tn-1+Tn-2+Tn-3, n3 with T0=0, T1=1 and T2=1. In recent years, few research scholars have been introduced Fibonacci-Like sequences which are similar to Fibonacci sequences in recurrence relation, but initial conditions are different. Due to this reason, these are known as Fibonacci-Like sequences. Tribonacci-Like sequences can be established by same pattern. A formula derived by Natividad to find missing terms for Fibonacci-like sequence. In this paper, we present a formula to find consecutive missing terms for Tribonacci-Like Sequences in terms of conventional Tribonacci numbers.

Keywords: Tribonacci Sequence, Tribonacci-Like Sequence, Missing term, Binet's Formula

How to Cite?: G.P.S. Rathore, Omprakash Sikhwal, Ritu Choudhary, "Missing Terms Formula for Tribonacci-Like Sequences", Volume 5 Issue 9, September 2016, International Journal of Science and Research (IJSR), Pages: 590-592, https://www.ijsr.net/getabstract.php?paperid=ART20161501, DOI: https://dx.doi.org/10.21275/ART20161501