Related papers: Binomial transforms of the modified k-Fibonacci-li…
In this study, we apply the binomial transforms to Tribonacci and Tribonacci-Lucas sequences. Also, the Binet formulas, summations, generating functions of these transforms are found using recurrence relations. Finally, we illustrate the…
In this study, we apply "r" times the binomial transform to k-Lucas sequence. Also, the Binet formula, summation, generating function of this transform are found using recurrence relation. Finally, we give the properties of iterated…
Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…
In this paper, we consider the matrix polynomial obtained by using bi-periodic Fibonacci matrix polynomial. Then, we give some properties and binomial transforms of the new matrix polynomials.
In this study, the new algebraic properties related to bivariate Fibonacci polynomials has been given. We present the partial derivatives of these polynomials in the form of convolution of bivariate Fibonacci polynomials. Also, we define a…
We give enumerations of various families of restricted permutations involving the Fibonacci numbers or k-generalized Fibonacci numbers.
Given two infinite sequences with known binomial transforms, we compute the binomial transform of the product sequence. Various identities are obtained and numerous examples are given involving sequences of special numbers: Harmonic…
In this paper, bicomplex k-Fibonacci quaternions are defined. Also, some algebraic properties of bicomplex k-Fibonacci quaternions which are connected with bicomplex numbers and k-Fibonacci numbers are investigated. Furthermore, the…
We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.
A generating function for reciprocal binomial coefficients is written down, integral representations of this function are obtained, generating functions for sums of reciprocal binomial coefficients are derived, new identities are obtained,…
In this paper, we introduce the Tribonacci and Tribonacci-Lucas quaternion polynomials. We obtain the Binet formulas, generating functions and exponential generating functions of these quaternions. Moreover, we give some properties and…
In this study, we apply "r" times the binomial transform to the Padovan and Perrin matrix sequences. Also, the Binet formulas, summations, generating functions of these transforms are found using recurrence relations. Finally, we give the…
In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving…
We present some new linear, quadratic, cubic and quartic binomial Fibonacci, Lucas and Fibonacci--Lucas summation identities.
We derive some q-analogs of Euler-Cassini-type identities and of recurrence formulas for powers of Fibonacci polynomials.
We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.
In this paper, we define the bi-periodic Fibonacci matrix sequence that represent bi-periodic Fibonacci numbers. Then, we investigate generating function, Binet formula and summations of bi-periodic Fibonacci matrix sequence. After that, we…
We present an elementary proof of the generalization of the $k$-bonacci Binet formula, a closed form calculation of the $k$-bonacci numbers using the roots of the characteristic polynomial of the $k$-bonacci recursion.
In this article, we introduce and study a new integer sequence referred to as the higher order Mersenne sequence. The proposed sequence is analogous to the higher order Fibonacci numbers and closely associated with the Mersenne numbers.…
One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms (generated by linear recurrent sequences…