We introduce a general Fibonacci sequence that generalizes, between others, both the
classic Fibonacci sequence and the Pell sequence. These general kth Fibonacci numbers …

The general k-Fibonacci sequence {Fk, n} n= 0∞ were found by studying the recursive
application of two geometrical transformations used in the well-known 4-triangle longest …

We introduce a generalization of Leonardo p-numbers, which extends the definition of
Leonardo p-numbers given by Tan and Leung, and investigate some of their basic …

On the Jacobsthal-Lucas Numbers by Matrix Method 1 Introduction Page 1 Int. J. Contemp. Math.
Sciences, Vol. 3, 2008, no. 33, 1629 - 1633 On the Jacobsthal-Lucas Numbers by Matrix Method …

In this paper, we define generalized k-Horadam sequence [Formula: see text]. After that, we
study the properties of the generalized k-Horadam sequence and prove some of these …

In this article, we study the bivariate Fibonacci and Lucas p–polynomials (p⩾ 0 is integer)
from which, specifying x, y and p, bivariate Fibonacci and Lucas polynomials, bivariate Pell …

Coding/decoding algorithms are of great importance to help in improving information
security sinceinformation security is a more significant problem in recent years. In this paper …

We have considered a class of square Fibonacci matrix of order (p+ 1) whose elements are
based on the Fibonacci p numbers with determinant equal to+ 1 or− 1. There is a relation …

In this paper, we present a new method of coding/decoding algorithms using Fibonacci Q-
matrices. This method is based on the blocked message matrices. The main advantage of …

On Gaussian Pell Polynomials and Their Some Properties Page 1 Palestine Journal of
Mathematics Vol. 7(1)(2018) , 251 256 © Palestine Polytechnic University-PPU 2018 On …