English
Related papers

Related papers: Two integer sequences related to Catalan numbers

200 papers

The $q$-analogue of an integer $m$ is given by $[m]_q=(1-q^m)/(1-q)$. Let $a$ be an integer, and let $n$ be a positive odd integer. Via discrete Fourier transforms, we establish the following two identities:…

Combinatorics · Mathematics 2026-05-19 Zhi-Wei Sun

In this paper, we introduce two differential equations arising from the generating function of the Catalan numbers which are `inverses' to each other in some sense. From these differential equations, we obtain some new and explicit…

Number Theory · Mathematics 2016-05-20 Taekyun Kim , Dae San Kim

Let $n\geq2$ be an integer. In this paper, we study the convexity of the so-called MacMahon's $q$-Catalan polynomials $C_n(q)=\frac1{[n+1]_q}\left[ 2n \atop n \right]_q$ as functions of $q$. Along the way, several intermediate results on…

Combinatorics · Mathematics 2023-09-06 Tewodros Amdeberhan

In this note we introduce several instructive examples of bijections found between several different combinatorially defined sequences of sets. Each sequence has cardinalities given by the Catalan numbers. Our results answer some questions…

Combinatorics · Mathematics 2013-03-01 Stefan Forcey , Mohammadmehdi Kafashan , Mehdi Maleki , Michael Strayer

In this paper, we generalize the Catalan number to the $(n,k)$-th Catalan numbers and find a combinatorial description that the $(n,k)$-th Catalan numbers is equal to the number of partitions of $n(k-1)+2$ polygon by $(k+1)$-gon where all…

Combinatorics · Mathematics 2015-01-28 Dongseok Kim

We give some elementary manifestly positive formulae for the Kronecker products s_(d,d) * s_(d+k,d-k) and s_(d,d) * s_(2d-k,1^k). These formulae demonstrate some fundamental properties of the Kronecker coefficients, and we use them to…

Combinatorics · Mathematics 2015-09-11 Andrew Brown , Stephanie van Willigenburg , Mike Zabrocki

We study the recursions $A(n) = A(n-a-A^k(n-b)) + A(A^k(n-b))$ where $a \geq 0$, $b \geq 1$ are integers and the superscript $k$ denotes a $k$-fold composition, and also the recursion $C(n) = C(n-s-C(n-1)) + C(n-s-2-C(n-3))$ where $s \geq…

Combinatorics · Mathematics 2014-07-03 Abraham Isgur , Mustazee Rahman

Recently, a new class of words, denoted by L_n, was shown to be in bijection with a subset of the Dyck paths of length 2n having cardinality given by the (n-1)-st Catalan number. Here, we consider statistics on L_n recording the number of…

Combinatorics · Mathematics 2014-07-15 Toufik Mansour , Mark Shattuck

We prove various congruences for Catalan and Motzkin numbers as well as related sequences. The common thread is that all these sequences can be expressed in terms of binomial coefficients. Our techniques are combinatorial and algebraic:…

Combinatorics · Mathematics 2007-05-23 Emeric Deutsch , Bruce E. Sagan

We introduce a transformation of finite integer sequences, show that every sequence eventually stabilizes under this transformation and that the number of fixed points is counted by the Catalan numbers. The sequences that are fixed are…

Combinatorics · Mathematics 2007-05-23 Zoran Sunik

We provide a context around a conjectured closed form for the Hankel transform of linear combinations of consecutive pairs of Catalan numbers. This generalizes the formula for the Hankel transforms of the shifted Catalan numbers and the…

Combinatorics · Mathematics 2020-11-24 Paul Barry

We extend our investigation of $2$-determinants, which we defined in a previous paper. For a linear homogenous recurrence of the second order, we consider relations between different sequences satisfying the same linear homogeneous…

Combinatorics · Mathematics 2021-05-12 Dusko Bogdanic , Milan Janjic

It is well known that the following Collatz Conjecture is one of the unsolved problems in mathematics. Collatz Conjecture: For any positive integer $n>1$, the following recursive algorithm will convergent to 1 by a finite number of steps.…

General Mathematics · Mathematics 2022-09-28 Lei Li

The modular Catalan numbers $C_{k,n}$, introduced by Hein and Huang in 2016 count equivalence classes of parenthesizations of $x_0 * x_1 * \dots *x_n$ where $*$ is a binary $k$-associative operation and $k$ is a positive integer. The…

Combinatorics · Mathematics 2020-07-03 Dixy Msapato

Let $n$ be a nonnegative integer. The $n$-th Ap\'{e}ry number is defined by $$ A_n:=\sum_{k=0}^n\binom{n+k}{k}^2\binom{n}{k}^2. $$ Z.-W. Sun ever investigated the congruence properties of Ap\'{e}ry numbers and posed some conjectures. For…

Number Theory · Mathematics 2020-06-30 Chen Wang

We present a $q$-analog of the super Catalan number $(2m)!(2n)!/2m!n!(m+n)!$, which also generalizes the $q$-Catalan numbers $c_n(\lambda)$, due to F\"urlinger and Hofbauer, for $\lambda=0$ and $\lambda=1$. We give a combinatorial…

Combinatorics · Mathematics 2014-09-02 Emily Allen , Irina Gheorghiciuc

In this paper, we prove two congruences on the double sums of the super Catalan numbers (named by Gessel), which were recently conjectured by Apagodu.

Number Theory · Mathematics 2018-04-26 Ji-Cai Liu

We study a certain family of infinite series with reciprocal Catalan numbers. We first evaluate two special candidates of the family in closed form, where we also present some Catalan-Fibonacci relations. Then we focus on the general…

Combinatorics · Mathematics 2022-01-07 Kunle Adegoke , Robert Frontczak , Taras Goy

It is well known that the numbers $(2m)! (2n)!/m! n! (m+n)!$ are integers, but in general there is no known combinatorial interpretation for them. When $m=0$ these numbers are the middle binomial coefficients $\binom{2n}{n}$, and when $m=1$…

Combinatorics · Mathematics 2007-05-23 Ira M. Gessel , Guoce Xin

Let $f:\mathbb{Z}\longrightarrow \{ \times \cdot\}$ be a function such that $f(a) = \cdot$ for all except finitely for many $a \in \mathbb{Z}$. We define a set $\flat f$ of non-intersecting arc (or cap) diagrams satisfying certain…

Combinatorics · Mathematics 2026-02-10 Ian M. Musson