 | ECS #703: A simple grammar |
| Introduction | Examples | Search | Submit | Help | Links |
1. Description
No description available
2. Specification
This labelled structure is specified as S in
\displaystyle
\left\{ B={\rm Cycle} \left( Z \right) ,S={\rm Prod} \left( Z,Z,B
\right) \right\}
other formats
3. Coefficients
3.1. First terms
3.2. Recurrence
\displaystyle
\left\{ \left( n-{n}^{2}+2 \right) f \left( n \right) + \left( n-1
\right) f \left( n+1 \right) =0,f \left( 0 \right) =0,f \left( 1
\right) =0,f \left( 2 \right) =0,f \left( 3 \right) =6,f \left( 4
\right) =12 \right\}
other formats
3.3. Closed form
\displaystyle
{\frac {\Gamma \left( n+1 \right) }{-2+n}}
other formats
3.4. Asymptotics
4. Exponential generating function
\displaystyle
{x}^{2}\ln \left( - \left( -1+x \right) ^{-1} \right)
other formats
5. References
6. Random structure
Search a combinatorial structure by: (firstTerms should be a sequence of integers, separated by commas).