Related papers: The trinomial transform triangle
The binomial interpolated transform of a sequence is a generalization of the well-known binomial transform. We examine a Pascal-like triangle, on which a binomial interpolated transform works between the left and right diagonals, focusing…
A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…
We introduce the tetrahedron trinomial coefficient transform which takes a Pascal-like arithmetical triangle to a sequence. We define a Pascal-like infinite tetrahedron H, and prove that the application of the tetrahedron trinomial…
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…
We introduce a linear algebraic object called a bidiagonal triple. A bidiagonal triple consists of three diagonalizable linear transformations on a finite-dimensional vector space, each of which acts in a bidiagonal fashion on the…
We give a generalization of the Pascal triangle called the quasi s-Pascal triangle where the sum of the elements crossing the diagonal rays produce the s-bonacci sequence. For this, consider a lattice path in the plane whose step set is {L…
In this paper one extends the binomial and trinomial coefficients to the concept of 'k-nomial' coefficients, and one obtains some properties of these. As an application one generalizes Pascal's triangle.
This article demonstrates, using numerous examples of varying complexity, how one can visually prove summation formulas involving binomial coefficients by exclusively using the recurrence relation for binomial coefficients and its…
We define recursive harmonic numbers as a generalization of harmonic numbers. The table of recursive harmonic numbers, which is like Pascal's triangle, is constructed. A formula for recursive harmonic numbers containing binomial…
We give an explicit formula for the Hankel transform of a regular sequence in terms of the coefficients of the associated orthogonal polynomials and the sequence itself. We apply this formula to some sequences of combinatorial interest,…
We study the Hankel transforms of sequences related to the central coefficients of a family of Pascal-like triangles. The mechanism of Riordan arrays is used to elucidate the structure of these transforms.
In this paper, we introduce a new generalization of Pascal's triangle. The new object is called the hyperbolic Pascal triangle since the mathematical background goes back to regular mosaics on the hyperbolic plane. We describe precisely the…
A "truncation" of Pascal's triangle is a triangular array of numbers that satisfies the usual Pascal recurrence but with a boundary condition that declares some terminal set of numbers along each row of the array to be zero. Presented here…
We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of another finite word. Similarly to the Sierpi\'nski gasket that…
We introduce a linear algebraic object called a bidiagonal triad. A bidiagonal triad is a modification of the previously studied and similarly defined concept of bidiagonal triple. A bidiagonal triad and a bidiagonal triple both consist of…
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…
We study a sequence transformation pipeline that maps certain sequences with rational generating functions to permutation-based sequence families of combinatorial significance. Many of the number triangles we encounter can be related to…
We compute the sum and the alternating sum of the reciprocals of triangular numbers using two standard methods from calculus: a telescoping series approach and a power series approach. We then extend these results to generalized…
We consider Tuenter polynomials as linear combinations of descending factorials and show that coefficients of these linear combinations are expressed via a Catalan triangle of numbers. We also describe a triangle of coefficients in terms of…
A dual approach to defining the triangle sequence (a type of multidimensional continued fraction algorithm, initially developed in NT/9906016) for a pair of real numbers is presented, providing a new, clean geometric interpretation of the…