Related papers: Congruences for Catalan and Motzkin numbers and re…
We present a higher genus generalization of $bc$-Motzkin numbers, which are themselves a generalization of Catalan numbers, and we derive a recursive formula which can be used to calculate them. Further, we show that this leads to a…
Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…
We present new proofs of eight integral representations of the Catalan numbers. Then, we create analogous integral representations of the Motzkin numbers and obtain new results. Most integral representations of counting sequences found in…
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…
We present a method to obtain congruences modulo powers of 2 for sequences given by recurrences of finite depth with polynomial coefficients. We apply this method to Catalan numbers, Fu\ss-Catalan numbers, and to subgroup counting functions…
In this paper we show that many well-known counting coefficients, including the Catalan numbers, the Motzkin numbers, the central binomial coefficients, the central Delannoy numbers are Hausdorff moment sequences in a unified approach. In…
In this paper, we study congruences on sums of products of binomial coefficients that can be proved by using properties of the Jacobi polynomials. We give special attention to polynomial congruences containing Catalan numbers, second-order…
We introduce a class of sequences, defined by means of partial Bell polynomials, that contains a basis for the space of linear recurrence sequences with constant coefficients as well as other well-known sequences like Catalan and Motzkin.…
We prove two congruences for the coefficients of power series expansions in t of modular forms where t is a modular function. As a result, we settle two recent conjectures of Chan, Cooper and Sica. Additionally, we provide a table of…
We develop the Stienstra-Beukers theory of supercongruences in the setting of the Catalan-Larcombe-French sequence. We also give some applications to other sequences.
We mainly show a supercongruence for a truncated series with cubes of Catalan numbers which extends a result by Zhi-Wei Sun.
In a recent beautiful but technical article, William Y.C. Chen, Qing-Hu Hou, and Doron Zeilberger developed an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequences,…
Using generalized binomial coefficients with respect to fundamental Lucas sequences we establish congruences that generalize the classical congruence of Wolstenholme and other related stronger congruences.
We present a method for obtaining congruences modulo powers of 3 for sequences given by recurrences of finite depth with polynomial coefficients. We apply this method to Catalan numbers, Motzkin numbers, Riordan numbers, Schr\"oder numbers,…
We establish a supercongruence conjectured by Almkvist and Zudilin, by proving a corresponding $q$-supercongruence. Similar $q$-supercongruences are established for binomial coefficients and the Ap\'{e}ry numbers, by means of a general…
We use the inversion of coefficient arrays to define dual polynomials to the Fibonacci and Catalan-Fibonacci polynomials, and we explore the properties of these new polynomials sequences. Many of the arrays involved are Riordan arrays.…
I study Hankel determinants of a class of sequences which can be interpreted as generalizations of the Catalan numbers and the central binomial coefficients. They follow a modular pattern with a frequent appearance of zeroes, so that the…
The Lucas sequence is a sequence of polynomials in s, and t defined recursively by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. On specialization of s and t one can recover the Fibonacci numbers, the nonnegative integers, and the…
We define a new generalization of Catalan numbers to multinomial coefficients. With arithmetic methods, we study their integrality and the integrality of their Lucasnomial generalization. We give a complete characterization of regular Lucas…
The binomial coefficients and Catalan triangle numbers appear as weight multiplicities of the finite-dimensional simple Lie algebras and affine Kac--Moody algebras. We prove that any binomial coefficient can be written as weighted sums…