On a Generalization for Tribonacci Quaternions
Abstract
Let Vn denote the third order linear recursive sequence defined by the initial values V0, V1 and V2 and the recursion Vn=rVn-1+sVn-2+tVn-3 if n≥ 3, where r, s, and t are real constants. The \Vn\n≥0 are generalized Tribonacci numbers and reduce to the usual Tribonacci numbers when r=s=t=1 and to the 3-bonacci numbers when r=s=1 and t=0. In this study, we introduced a quaternion sequence which has not been introduced before. We show that the new quaternion sequence that we introduced includes the previously introduced Tribonacci, Padovan, Narayana and Third order Jacobsthal quaternion sequences. We obtained the Binet formula, summation formula and the norm value for this new quaternion sequence.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.