https://hal.inria.fr/hal-00990439Currie, JamesJamesCurrieDepartment of Mathematics and Statistics [Winipeg] - University of WinnipegRampersad, NaradNaradRampersadDepartment of Mathematics and Statistics [Winipeg] - University of WinnipegCubefree words with many squaresHAL CCSD2010cubefree wordsquare[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Inria Sophia Antipolis-MÃ©diterranÃ©e / I3s, Service Ist2014-05-13 15:37:082018-06-02 17:50:012014-05-13 16:03:51enJournal articleshttps://hal.inria.fr/hal-00990439/document10.46298/dmtcs.486application/pdf1We 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.