In this work, we define a quadra Fibona-Pell integer sequence W n = 3 W n − 1 − 3 W n − 3 − W n − 4 for n ≥ 4 with initial values W 0 = W 1 = 0 , W 2 = 1 , W 3 = 3 , and we derive some algebraic identities on it including its relationship with Fibonacci and Pell numbers.
10 April 2021 in Mathematical Methods in the Applied Sciences
In this work, we introduce bivariate Fibonacci quaternion polynomials andbivariate Lucas quaternion polynomials. We present generating function,Binet formula, matrix representation, binomial formulas and some basicidentities for the bivariate Fibonacci and Lucas quaternion polynomialsequences. Moreover we give various kinds of sums for these quaternionpolynomials.
The main object of the present paper is to consider the binomial transforms for Horadam quaternion sequences. We gave new formulas for recurrence relation, generating function, Binet formula and some basic identities for the binomial sequence of Horadam quaternions. Working with Horadam quaternions, we have found the most general formula that includes all binomial transforms with recurrence relation from the second order. In the last part, we determined the recurrence relation for this new type of quaternion by working with the iterated binomial transform, which is a dierent type of binomial transform.
4 March 2024 in Communications in Advanced Mathematical Sciences
In this study, previously obtained cobalancing numbers are considered from a different perspective, and the properties of the numbers are re-examined. The main purpose is to change the recurrence relation of cobalancing numbers and calculate some relations and properties in a more diverse and easier way. The reason that led us to this method is that the recurrence relation of cobalancing numbers has a second-order but non-homogeneous difference equations. Thus, it will be much easier to find the Binet formula, generating function, sum formulas, and many other relations with a sequence that is homogeneous and has a third-degree recurrence relation. Also some identities that have not been found before in the sequence are also included in this study.
30 September 2024 in Fundamental Journal of Mathematics and Applications
The aim of the study is to obtain new binomial transforms for the $k-$ Narayana sequence. The first of these is the binomial transform, which is its normal form, and in the first step, after finding the recurrence relation of this new binomial transform, the generating function and Binet formula were obtained. Finally, Pascal's triangle was calculated. In the rest of the article, $k-$binomial transform was performed for the $k-$ Narayana sequence and the recurrence relation, generating function, Binet formula and Pascal's triangle were examined for the new sequence obtained. Then, by performing the falling binomial transform and the rising binomial transform, the features listed above were found again for these sequences.