Minimal total number of multiplications by single letters needed to generate all words of length n in the free monoid on two generators. 0, 2, 6, 13, 2
2 seqfan posts