ECS #1065: A simple regular expression
 | ECS #1065: A simple regular expression
|
1. Description
No description available
2. Specification
This
unlabelled
structure is specified as S in
\displaystyle
\left\{ S={\rm Prod} \left( {\rm Sequence} \left( {\rm Union} \left( Z
,Z,{\rm Prod} \left( Z,Z \right) \right) \right) ,{\rm Sequence}
\left( Z \right) \right) \right\}
other formats
3. Coefficients
3.1. First terms
3.2. Recurrence
\displaystyle
\left\{ -f \left( n \right) -2\,f \left( n+1 \right) +f \left( n+2
\right) -1=0,f \left( 0 \right) =1,f \left( 1 \right) =3 \right\}
other formats
3.3. Closed form
\displaystyle
-1/2+\sum _{\alpha={\rm RootOf} \left( -1+2\,{\rm \_Z}+{{\rm \_Z}}^{2}
\right) }1/4\, \left( 2+\alpha \right) {\alpha}^{-1-n}
other formats
3.4. Asymptotics
4. Ordinary
generating function
\displaystyle
{\frac {1}{ \left( -1+2\,x+{x}^{2} \right) \left( -1+x \right) }}
other formats
5. References
EIS A048739
6. Random structure
Search a combinatorial structure by: (firstTerms should be a sequence of integers, separated by commas).
Generated: 2010-02-09 22:55:29 in 2. seconds of elapsed time.
Based on commit 9d1e479..., Fri Jul 10 14:52:30 2009 +0200.
Powered by
DynaMoW.