Tricomplex Fibonacci Numbers: A New Family of Fibonacci-Type Sequences

In this paper, we define a novel family of arithmetic sequences associated with the Fibonacci numbers. Consider the ordinary Fibonacci sequence { f n } n ∈ N 0 having initial terms f 0 = 0 , and f 1 = 1 and recurrence relation f n = f n − 1 + f n − 2 ( n ≥ 2 ) . In many studies, authors worked on the generalizations of integer sequences in different ways, some by preserving the initial terms, others by preserving the recurrence relation, and some for numeric sets other than positive integers. Here, we will follow the third path. So, in this article, we study a new extension t f n ∗ , with initial terms t f 0 ∗ = ( f 0 ∗ , f 1 ∗ , f 2 ∗ ) and t f 1 ∗ = ( f 1 ∗ , f 2 ∗ , f 3 ∗ ) , which is generated by the recurrence relation t f n ∗ = t f n − 1 ∗ + t f n − 2 ∗ ( n ≥ 2 ) , the Fibonacci-type sequence. The aim of this paper is to define Tricomplex Fibonacci numbers as an extension of the Fibonacci sequence and to examine some of their properties such as the recurrence relation, summation formula and generating function, and some classical identities.