The number of binary cube-free words of length up to 47 and their numerical analysis

An analog of the work of Noonan and Zeilberger on square-free ternary words given for the case of cube-free binary words. As in their work, the Goulden-Jackso Cluster Method is used to derive a rigorous upper bound, as well as a non-rigorot estimate, for the limit of thenth roots of the terms. The Maple implementatin of the work is available from this paper's website www.math.temple. edu/`anne/cut free.html.