Related papers: Non-classical linear divisibility sequences and cy…
We have studied several generalizations of Fibonacci sequences as the sequences with arbitrary initial values, the addition of two and more Fibonacci subsequences and Fibonacci polynomials with arbitrary bases. For Fibonacci numbers with…
The concept of scattered polynomials is generalized to those of exceptional scattered sequences which are shown to be the natural algebraic counterpart of $\mathbb{F}_{q^n}$-linear MRD codes. The first infinite family in the first…
In this work, we study cyclic codes that have generators as Fibonacci polynomials over finite fields. We show that these cyclic codes in most cases produce families of maximum distance separable and optimal codes with interesting…
We consider two division problems on narrow strips of square and hexagonal lattices. In both cases we compute the bivariate enumerating sequences and the corresponding generating functions, which allowed us to determine the asymptotic…
We present a certain generalization of a recent result of M. I. Cirnu on linear recurrence relations with coefficient in progressions [2]. We provide some interesting examples related to some well-known integer sequences, such as Fibonacci…
Investigation of divisibility properties of natural numbers is one of the most important themes in the theory of numbers. Various tools have been developed over the centuries to discover and study the various patterns in the sequence of…
Using sequences of finite length with positive integer elements and the inversion statistic on such sequences, a collection of binomial and multinomial identities are extended to their $q$-analog form via combinatorial proofs. Using the…
Multidimensional continued fractions generalize classical continued fractions with the aim of providing periodic representations of algebraic irrationalities by means of integer sequences. However, there does not exist any algorithm that…
We dedicate this paper to investigate the most generalized form of Fibonacci Sequence, one of the most studied sections of the mathematical literature. One can notice that, we have discussed even a more general form of the conventional one.…
We study a new class of polyominoes, called $p$-Fibonacci polyominoes, defined using $p$-Fibonacci words. We enumerate these polyominoes by applying generating functions to capture geometric parameters such as area, semi-perimeter, and the…
We generalize the class of split graphs to the directed case and show that these split digraphs can be identified from their degree sequences. The first degree sequence characterization is an extension of the concept of splittance to…
Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…
A sequence is a fractal sequence if it contains itself as a proper subsequence. (The self-containment property resembles that of visual fractals) A doubly fractal sequence of integers is defined by operations called upper trimming and lower…
The Tribonacci sequence is a well-known example of third order recurrence sequence, which belongs to a particular class of recursive sequences. In this article, other generalized Tribonacci sequence is introduced and defined by…
This note considers linear recurrences (also called linear difference equations) in unknowns indexed by the integers. We characterize a unique \emph{reduced} linear recurrence with the same solutions as a given linear recurrence, and…
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…
Some applications of a result, which is proved recently, is considered. We first prove three determinantal identities concerning the binomial coefficient and Stirling numbers of the first and the second kind. We also easily obtain the…
In this paper, by presenting bi-periodic Lucas numbers as a binomial sum, we introduce the bi-periodic incomplete Lucas numbers. After that, by using the bi-periodic incomplete Lucas numbers, we derive the recurrence relation and the…
In two previous papers we have presented partition formulae for the Fibonacci numbers motivated by the appearance of the Fibonacci numbers in the representation theory of the 3-Kronecker quiver and its universal cover, the 3-regular tree.…
An integer $n$ is said to be \textit{arithmetic} if the arithmetic mean of its divisors is an integer. In this paper, using properties of the factorization of values of cyclotomic polynomials, we characterize arithmetic numbers. As an…