Minimal total number of multiplications needed to generate all words of length n in the free monoid on two generators. 0, 4, 11, 20, 42, 7
2 seqfan posts