In mathematical terms, sequence is a list of number s arranged in a specific order. Tribonacci sequence is a sequence of whole n umbers with equations T 0 = 0, T 1 = 0 and T 2 = 1 in which T n = T n-1 + T n-2 + T n-3. When the first three terms of the tribonacci sequence become arbitrary, it is kno wn as tribonacci-like sequence. Tribonacci-like sequence can start at any desired n umber. This study aimed to derive and validate a formula in solving tribonacci -like sequence. Basic equations were derived on finding n th term (S n) of Tribonacci-like sequence given its arbitrary first three terms. Formulas of S n for four terms (n = 4), five terms (n = 5), six terms (n = 6) and seven terms (n = 7) were solved. From these formulas, numerical coefficients of the first three terms wer e tabulated and patterns were recognized. In these patterns, a formula was obtain ed in solving n th term of Tribonacci-like sequence using its first three term s and Tribonacci numbers. The novel formula is