Combinatorial Structure of finite sequences is defined by
where
When
we may write
When
we may write
Lemma
Ordinary Generating Function and Exponential Generating Function are:
Proof 1
Both go well with Combinatorial Union and Combinatorial Product
and we have
Proof 2
Each sequence is either empty or has a first element thus: