Related papers: On One-Parameter Catalan Arrays
We present a differential-calculus-based method which allows one to derive more identities from {\it any} given Fibonacci-Lucas identity containing a finite number of terms and having at least one free index. The method has two {\it…
We first establish the result that the Narayana polynomials can be represented as the integrals of the Legendre polynomials. Then we represent the Catalan numbers in terms of the Narayana polynomials by three different identities. We give…
Various families of octonion number sequences (such as Fibonacci octonion, Pell octonion and Jacobsthal octonion) have been established by a number of authors in many different ways. In addition, formulas and identities involving these…
The Pascal matrix, which is related to Pascal's triangle, appears in many places in the theory of uniform distribution and in many other areas of mathematics. Examples are the construction of low-discrepancy sequences as well as normal…
By using the Newton interpolation formula, we generalize the recent identities on the Catalan triangle obtained by Miana and Romero as well as those of Chen and Chu. We further study divisibility properties of sums of products of binomial…
We introduce a large family of combinatorial objects, called standard puzzles, defined by very simple rules. We focus on the standard puzzles for which the enumeration problems can be solved by explicit formulas or by classical numbers,…
Based on a variant of Sury's polynomial identity we derive new expressions for various finite Fibonacci (Lucas) sums. We extend the results to Fibonacci and Chebyshev polynomials, and also to Horadam sequences. In addition to deriving sum…
To a $2\times2$ matrix $G$ with complex entries, we relate the sequence of Laurent polynomial $L_n(z,G)=\tr \big(G\big[\begin{smallmatrix}z&0\\ 0&z^{-1}\end{smallmatrix}\big]G^{\ast}\big)^n$. It turns out that for each \(n\), the family…
The \emph{Hosoya triangle} is a triangular array where every entry is a product of two Fibonacci numbers. We use the geometry of this triangle to find new identities related to Fibonacci numbers. We give geometric interpretation for some…
In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show…
We give a direct and intuitive proof (via sliding some columns up and down) of the following interesting fact: if we write out the Chebyshev polynomials in a chart and take the sums of coefficients along certain diagonals, we obtain the…
A new one-parameter family of iterative method for solving nonlinear equations is constructed and studied. Two variants, both with cubic convergence, are developed, one for finding simple zeros and other for multiple zeros of known…
Riordan arrays, denoted by pairs of generating functions (g(z), f(z)), are infinite lower-triangular matrices that are used as combinatorial tools. In this paper, we present Riordan and stochastic Riordan arrays that have connections to the…
Writing the values of Krawtchouk polynomials as matrices, we consider weighted partial sums along columns. For the general case, we find an identity that, in the symmetric case yields a formula for such partial sums. Complete sums of…
The moments of the Lucas polynomials and of the Chebyshev polynomials of the first kind are (multiples of) central binomial coefficients and the moments of the Fibonacci polynomials and of the Chebyshev polynomials of the second kind are…
In this paper we introduce and investigate a one-parameter family of polynomials. They are semisymmetric, i.e. symmetric in the variables with odd and even index separately. In fact, the family forms a basis of the space of semisymmetric…
The study of some parametric integrals is presented with a combined approach of analytical development, the usage of a Computed Algebra System (CAS) and of the Online Encyclopedia of Integer Sequences. The methodology for the solution…
In this note, we explore links between Riordan arrays and lattice paths. We begin by describing Riordan arrays, and some of their generalizations, including rectifications and triangulations. We the consider Riordan array links to lattice…
Certain famous combinatorial sequences, such as the Catalan numbers and the Motzkin numbers, when taken modulo a prime power, can be computed by finite automata. Many theorems about such sequences can therefore be proved using Walnut, which…
In this paper, we study a structured family of matrices whose entries are given by products of $k$-Fibonacci and $k$-Lucas numbers. For this family, we obtain explicit and unified formulas for several classical matrix invariants, including…