 | ECS #9: Words with at most 1 consecutive b-letters |
| Introduction | Examples | Search | Submit | Help | Links |
1. Description
- Words with at most 1 consecutive b-letters
- Fibonacci numbers
- integer F(n) such that F(n)=F(n-1)+F(n-2), F(0)=F(1)=1
2. Specification
This unlabelled structure is specified as S in
\displaystyle
\left\{ S={\rm Prod} \left( X,{\rm Sequence} \left( {\rm Prod} \left(
a,X \right) \right) \right) ,X={\rm Sequence} \left( b,{\rm card}
\leq 1 \right) ,a={\rm Atom},b={\rm Atom} \right\}
other formats
3. Coefficients
3.1. First terms
3.2. Recurrence
\displaystyle
\left\{ f \left( n \right) +f \left( n+1 \right) -f \left( n+2
\right) =0,f \left( 0 \right) =1,f \left( 1 \right) =2 \right\}
other formats
3.3. Closed form
\displaystyle
\sum _{\alpha={\rm RootOf} \left( -1+{\rm \_Z}+{{\rm \_Z}}^{2} \right)
}1/5\, \left( 3+\alpha \right) {\alpha}^{-1-n}
other formats
3.4. Asymptotics
4. Ordinary generating function
\displaystyle
-{\frac {1+x}{-1+x+{x}^{2}}}
other formats
5. References
6. Random structure
Search a combinatorial structure by: (firstTerms should be a sequence of integers, separated by commas).