 | ECS #748: 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 Set} \left( Z \right) ,S={\rm Prod} \left( Z,Z,Z,B,B,B
\right) \right\}
other formats
3. Coefficients
3.1. First terms
3.2. Recurrence
\displaystyle
\left\{ \left( -3\,n-3 \right) f \left( n \right) + \left( -2+n
\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 \right\}
other formats
3.3. Closed form
\displaystyle
{3}^{-3+n}n \left( n-1 \right) \left( -2+n \right)
other formats
3.4. Asymptotics
4. Exponential generating function
\displaystyle
{x}^{3} \left( {{\rm e}^{x}} \right) ^{3}
other formats
5. References
6. Random structure
Search a combinatorial structure by: (firstTerms should be a sequence of integers, separated by commas).