Cubefree words with many squares
Currie, James D.
Currie, James D., and Narad Rampersad. “Cubefree words with many squares.” Discrete Mathematics and Theoretical Computer Science 12(3) (2010): 29-34.
We construct infinite cubefree binary words containing exponentially many distinct squares of length n . We also show that for every positive integer n , there is a cubefree binary square of length 2n.