English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The $n^{\text{th}}$ small Schr\"oder number is $s(n) = \sum_{k \geq 0}s(n,k)$, where $s(n,k)$ denotes the number of plane rooted trees with $n$leaves and $k$ internal nodes that each has at least two children. In thismanuscript, we focus on the weighted small Schr\"oder numbers $s_d(n) = \sum_{k\geq 0} s(n,k) d^k$, where $d$ is an arbitrary fixed real number. We providerecursive and asymptotic formulas for $s_d(n)$, as well as some identities andcombinatorial interpretations for these numbers. We also establish connectionsbetween $s_d(n)$ and several families of Dyck paths.

Some Properties and Combinatorial Implications of Weighted Small Schr\"oder Numbers