ECS #811: A simple grammar
 | ECS #811: A simple grammar
|
1. Description
No description available
2. Specification
This
unlabelled
structure is specified as S in
\displaystyle
\left\{ B={\rm PowerSet} \left( C \right) ,C={\rm Prod} \left( Z,B
\right) ,S={\rm Set} \left( C \right) \right\}
other formats
3. Coefficients
3.1. First terms
4. Ordinary
generating function
\displaystyle
[B \left( x \right) ={{\rm e}^{\sum _{j_{{1}}=1}^{\infty }-{\frac {
\left( -1 \right) ^{j_{{1}}}C \left( {x}^{j_{{1}}} \right) }{j_{{1}}}}
}},C \left( x \right) =xB \left( x \right) ,S \left( x \right) ={
{\rm e}^{\sum _{j_{{2}}=1}^{\infty }{\frac {C \left( {x}^{j_{{2}}}
\right) }{j_{{2}}}}}},Z \left( x \right) =x]
other formats
5. References
EIS A052843
6. Random structure
Search a combinatorial structure by: (firstTerms should be a sequence of integers, separated by commas).
Generated: 2010-02-09 17:19:32 in 1. seconds of elapsed time.
Based on commit 9d1e479..., Fri Jul 10 14:52:30 2009 +0200.
Powered by
DynaMoW.