Number of terms of length < n that are needed on the way to computing all words of length n in the free monoid with two generators. 0, 0, 3, 4, 10, 1
2 seqfan posts