Paperfolding and Catalan numbers
نویسنده
چکیده
1 : This paper reproves a few results concerning paperfolding sequences using properties of Catalan numbers modulo 2. The guiding principle can be described by: Paperfolding = Catalan modulo 2 + signs given by 2−automatic sequences.
منابع مشابه
An Irrationality Measure for Regular Paperfolding Numbers
Let F(z) = ∑ n>1 fnz n be the generating series of the regular paperfolding sequence. For a real number α the irrationality exponent μ(α), of α, is defined as the supremum of the set of real numbers μ such that the inequality |α − p/q| < q−μ has infinitely many solutions (p, q) ∈ Z × N. In this paper, using a method introduced by Bugeaud, we prove that μ(F(1/b)) 6 275331112987 137522851840 = 2....
متن کاملSome Properties of the Fuss–catalan Numbers
In the paper, the authors express the Fuss–Catalan numbers as several forms in terms of the Catalan–Qi function, find some analytic properties, including the monotonicity, logarithmic convexity, complete monotonicity, and minimality, of the Fuss–Catalan numbers, and derive a double inequality for bounding the Fuss–Catalan numbers.
متن کاملThe Super Patalan Numbers
We introduce the super Patalan numbers, a generalization of the super Catalan numbers in the sense of Gessel, and prove a number of properties analogous to those of the super Catalan numbers. The super Patalan numbers generalize the super Catalan numbers similarly to how the Patalan numbers generalize the Catalan numbers.
متن کاملParametric Catalan Numbers and Catalan Triangles
Here presented a generalization of Catalan numbers and Catalan triangles associated with two parameters based on the sequence characterization of Bell-type Riordan arrays. Among the generalized Catalan numbers, a class of large generalized Catalan numbers and a class of small generalized Catalan numbers are defined, which can be considered as an extension of large Schröder numbers and small Sch...
متن کاملStaircase tilings and k-Catalan structures
Many interesting combinatorial objects are enumerated by the k-Catalan numbers, one possible generalization of the Catalan numbers. We will present a new combinatorial object that is enumerated by the k-Catalan numbers, staircase tilings. We give a bijection between staircase tilings and k-good paths, and between k-good paths and k-ary trees. In addition, we enumerate k-ary paths according to D...
متن کامل