  We define C sequential optimization numbers, where C is a k+1-tuple vector.
We prove that the unsigned Stirling numbers of first kind are (0,1) sequential
optimization numbers. Many achievements of the Stirling numbers of first kind
can be transformed into the properties of C sequential optimization numbers. We
give some examples such as the recurrence formula and an instance of C
sequential optimization numbers. We also extend some properties such as an
upper bounder of them.
