Number of words of length strictly between 1 and n that are needed on the way to computing all words of length n in the free monoid with two generators.

A075100

Number of words of length strictly between 1 and n that are needed on the way to computing all words of length n in the free monoid with two generators.

Terms

    a(0) =0a(1) =0a(2) =3a(3) =4a(4) =10a(5) =11

External references