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