We consider sequences of the type $A_n=6A_{n-1}-A_{n-2}, A_0=r, A_1=s$ ($r$ and $s$ integers) and show that all sequences that solve particular cases of the Pell generalized equation are expressible as a constant times one of four particular sequences of the same type.
In this paper, we investigate the generalized Pell sequence, the generalized complex Pell sequence and the generalized dual Pell sequence using the Pell numbers. We obtain special cases of these sequences. Furthermore, we give recurrence relations, vectors, the silver ratio and Binet's formula for the above-investigated sequences.
In this paper some properties of generalized tribonacci and generalized Padovan sequence are presented. Also the Euclidean norms of circulant, $r$-circulant, semi-circulant and Hankle matrices with above mentioned sequences are calculated. The upper and lower bounds of spectral norms are also obtained.
In this paper we extend the notion of Melham sum to the Pell and Pell-Lucas sequences. While the proofs of general statements rely on the binomial theorem, we prove some spacial cases by the known Pell identities. We also give extensions of obtained expressions to the other recursive sequences.
We consider compositions of natural numbers when there are different types of each natural number. Several recursions as well as some closed formulas for the number of compositions is derived. We also find its relationships with some known classes of integers such as Fibonacci, Catalan, Pell, Pell-Lucas, and Jacobsthal numbers.
Let $a,b,c $ be any positive integers such that $c\mid ab$ and $d_i^\pm$ is a square free positive integer of the form $d_i^\pm=a^{2k} b^{2l}\pm i c^m$ where $k,l \geq m$ and $i=1,2.$ The main focus of this paper to find the fundamental solution of the equation $ x^2-d_i^\pm y^2=1$ with the help of the continued fraction of $\sqrt{d_i^\pm}.$ We also obtain all the positive solutions of the equations $ x^2-d_i^\pm y^2=\pm 1$ and $ x^2-d_i^\pm y^2=\pm 4$ by means of the Fibonacci and Lucas sequences. Furthermore, in this work, we derive some algebraic relations on the Pell form $ F_{d_i^\pm}(x, …
Motivated by Elementary Problem B-1172 in the Fibonacci Quarterly (vol. 53, no. 3, pg. 273), formulas for the areas of triangles and other polygons having vertices with coordinates taken from various sequences of integers are obtained. The sequences discussed are Polygonal number sequences as well as Fibonacci, Lucas, Jacobsthal, Jacobsthal-Lucas, Pell, Pell-Lucas, and Generalized Fibonacci sequences. The polygons have vertices with the form $(p_n,p_{n+k}),\,\, (p_{n+2k},p_{n+3k}),\,\,\dots ,(p_{n+(2m-2)k},p_{n+(2m-1)k)}$.
In this paper we present applications of some special numbers obtained from a difference equation of degree three, especially in the Coding Theory. As a particular case, we obtain the generalized Pell-Fibonacci-Lucas numbers, which were extended to the generalized quaternions.
We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.
Let $F(z)$ be a $k$-regular series in $\mathbb{Z}[[z]]$ and $b$ be an integer with $b\ge2$. Bell, Bugeaud and Coons [BelBC] proved that $F(\frac{1}{b})$ is either rational or transcendental. In [Mi], we introduce a generalized $k$-regular sequence as a unification of several kinds of important sequences including $k$-regular, $k$-additive and $k$-multiplicative sequences. In this paper, we give a generalization of the result of Bell, Bugeaud and Coons for certain generalized $k$-regular series. Especially, we show that the values of irrational generating functions of certain sum of $k$-additiv…
Integer compositions with certain colored parts were introduced by Andrews in 2007 to address a number-theoretic problem. Integer compositions allowing zero as some parts were introduced by Ouvry and Polychronakos in 2019. We give a bijection between these two varieties of compositions and determine various combinatorial properties of these multicompositions. In particular, we determine the count of multicompositions by number of all parts, number of positive parts, and number of zeros. Then, working from three types of compositions with restricted parts that are counted by the Fibonacci seque…
Motivated by the known autocorrelation properties of the Rudin-Shapiro sequence, we study the discrete correlation among infinite sequences over a finite alphabet, where we just take into account whether two symbols are identical. We show by combinatorial means that sequences cannot be "too" different, and by an explicit construction generalizing the Rudin-Shapiro sequence, we show that we can achieve the maximum possible difference.
We determine the degree sequence of the generalized Sierpinski graph and its general first Zagreb index in terms of the same parameters of the base graph G.
Existence of Solutions of Functional-Difference Equations with Proportional Delay on Deformed Generalized Fibonacci Polynomials via Successive Approximation and Bell Polynomials
本文构建变形广义 Fibonacci 多项式上的微积分为框架,借助变形指数函数、逐次逼近法和 Bell 多项式证明比例延迟泛函差分方程解的存在性,并指出 q-周期情形下解不唯一。
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 major index statistic on sequences, a connection between integer partitions with kinds and finite differences of the coefficients of generalized Galois numbers is established.
In this note we use the analogy between the Catalan sequence and the Rueppel sequence to derive a variety of conjectures surrounding the Hankel transforms of a number of sequences closely related to the Rueppel sequence. Use is made of the representation of suitable generating functions by Stieltjes continued fractions. We define polynomial sequences by introducing parameters that define generalized Rueppel sequences, and we show that such polynomials have coefficient arrays that are Riordan arrays. Finally we conjecture the form of a product of Hankel transforms arising from the Rueppel seque…
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 $H_{n+2}=H_{n+1}+H_{n}+H_{n-1}\ \ (n\geq 1)$, where $H_{0}=3$, $H_{1}=0$ and $H_{2}=2$. Also $n$-th power of the generating matrix for this generalized Tribonacci sequence is established and some basic properties of this sequence are obtained by matrix methods. There are many elementary formulae relating the various $H_{n}$, most of which, since the sequence is defined …