Minimal total number of multiplications needed to generate all words of length n in the free monoid on two generators.

A075099

Minimal total number of multiplications needed to generate all words of length n in the free monoid on two generators.

Terms

    a(0) =0a(1) =4a(2) =11a(3) =20a(4) =42a(5) =75

External references