相关论文: Paperfolding and Catalan numbers
We discuss the properties of the Hankel transformation of a sequence whose elements are the sums of consecutive generalized Catalan numbers and find their values in the closed form.
The Catalan numbers are well-known to be the answer to many different counting problems, and so there are many different families of sets whose cardinalities are the Catalan numbers. We show how such a family can be given the structure of a…
We introduce the super Patalan numbers, a generalization of the super Catalan numbers in the sense of Gessel, and prove a number of properties analagous to those of the super Catalan numbers. The super Patalan numbers generalize the super…
Using generalized binomial coefficient identities and some results of John Dougall, we derive some families of series involving the cubes of Catalan numbers. We also establish a family of series containing fourth powers of Catalan numbers.…
This paper is a short survey of the recent results on examples of periodic two-dimensional continued fractions (in Klein's model). In the last part of this paper we formulate some questions, problems and conjectures on geometrical…
Li et al. give an integral formula for the Catalan-Qi number of the second kind. They show that this integral can be written as a summation with double factorials. In this paper the integral is reduced to a product of the Catalan number and…
We give a new proof of the $k$-fold convolution of the Catalan numbers. This is done by enumerating a certain class of polygonal dissections called $k$-in-$n$ dissections. Furthermore, we give a formula for the average number of cycles in a…
In this note we give a survey about polynomials whose moments are multiples of super Catalan numbers and explore two different kinds of q-analogues.
In this paper, we study the combinatorial structures of straight and ordinary m\'enage permutations. Based on these structures, we prove four formulas. The first two formulas define a relationship between the m\'enage numbers and the…
We introduce the three-Catalan triangle, highlighting the three-Catalan numbers along with their recurrence relation and combinatorial interpretation, which allows us to establish their log-convexity. Additionally, we prove that the rows of…
Easily computable lower and upper bounds are found for the sum of Catalan numbers. The lower bound is proven to be tighter than the upper bound, which previously was declared to be only an asymptotic. The average of these bounds is proven…
We give a new proof of the following statement: the Catalan number $C_n$ is divisible by $n+2$, if $n$ is odd and $n\not\equiv 1\text{ mod }3$.
An interesting class of automatic sequences emerges from iterated paperfolding. The sequences generate curves in the plane with an almost periodic structure. We generalize the results obtained by Davis and Knuth on the self-avoiding and…
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…
We establish a connection between constructible representations (arising in the study of left cells in Weyl groups) and Catalan numbers.
Multiple analogues of certain families of combinatorial numbers are recently constructed by the author in terms of well poised Macdonald functions, and some of their fundamental properties are developed. In this paper, we present…
We investigate compositions of a positive integer with a fixed number of parts, when there are several types of each natural number. These compositions produce new relationships among binomial coefficients, Catalan numbers, and numbers of…
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 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…
For each integer n, an n-folding curve is obtained by folding n times a strip of paper in two, possibly up or down, and unfolding it with right angles. Generalizing the usual notion of infinite folding curve, we define complete folding…