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