 | ECS #42: Schroeder's problem |
| Introduction | Examples | Search | Submit | Help | Links |
1. Description
Schroeder's problem. Dissections of a polygon or parenthesizing a product
2. Specification
This unlabelled structure is specified as S in
\displaystyle
\left\{ S={\rm Union} \left( Z,{\rm Sequence} \left( S,2\leq {\rm card
} \right) \right) \right\}
other formats
3. Coefficients
3.1. First terms
3.2. Recurrence
\displaystyle
\left\{ \left( n-1 \right) f \left( n \right) + \left( -3-6\,n
\right) f \left( n+1 \right) + \left( n+2 \right) f \left( n+2
\right) =0,f \left( 0 \right) =0,f \left( 1 \right) =1,f \left( 2
\right) =1 \right\}
other formats
3.3. Asymptotics
4. Ordinary generating function
\displaystyle
1/4+1/4\,x-1/4\,\sqrt {1-6\,x+{x}^{2}}
other formats
5. References
6. Random structure
Search a combinatorial structure by: (firstTerms should be a sequence of integers, separated by commas).