 | ECS #101 |
| 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 Cycle} \left( Z \right) ,C={\rm Set} \left( B,1\leq {
\rm card} \right) ,S={\rm Union} \left( B,C \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+1 \right) + \left(
n+2 \right) f \left( n+2 \right) =0,f \left( 0 \right) =0,f \left( 1
\right) =2,f \left( 2 \right) =3,f \left( 3 \right) =8 \right\}
other formats
3.3. Closed form
\displaystyle
{\frac {\Gamma \left( n+2 \right) }{n}}
other formats
3.4. Asymptotics
4. Exponential generating function
\displaystyle
\left( -\ln \left( - \left( -1+x \right) ^{-1} \right) +\ln \left( -
\left( -1+x \right) ^{-1} \right) x-x \right) \left( -1+x \right) ^{-
1}
other formats
5. References
6. Random structure
Search a combinatorial structure by: (firstTerms should be a sequence of integers, separated by commas).