A classic proof of a recurrence for a very classical sequence

DOI10.1006/jcta.1997.2814zbMath0883.05007arXivmath/9805015OpenAlexW2143442390MaRDI QIDQ1374205

Doron Zeilberger, Foata, Dominique

Publication date: 2 December 1997

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9805015

zbMATH Keywords

bijectionSchröder numberswell-weighted trees

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15)

Related Items (18)

Three recurrences for parallelogram polyominoes ⋮ Permutation of elements in double semigroups ⋮ Uniform generation of a Schröder tree ⋮ The Narayana distribution ⋮ A unified approach to polynomial sequences with only real zeros ⋮ Parametric Catalan numbers and Catalan triangles ⋮ A criterion for the log-convexity of combinatorial sequences ⋮ A relation between Schröder paths and Motzkin paths ⋮ On the log-convexity of combinatorial sequences ⋮ Bijective proofs of recurrences involving two Schröder triangles ⋮ Logarithmic behavior of some combinatorial sequences ⋮ Riordan paths and derangements ⋮ Analytic properties of combinatorial triangles related to Motzkin numbers ⋮ Schröder's paths and random hierarchies ⋮ Bijective recurrences for Motzkin paths ⋮ Some Properties and Combinatorial Implications of Weighted Small Schr\"oder Numbers ⋮ Loopless Algorithms And SchrÖder Trees ⋮ The signs of three-term recurrence sequences

Cites Work

• Calcul pratique des coefficients de Taylor d'une fonction algébrique
• Hipparchus, Plutarch, Schroder, and Hough
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A classic proof of a recurrence for a very classical sequence