OFFSET
0,2
LINKS
J. Karhumäki and J. Shallit, Polynomial vs Exponential Growth in Repetition-Free Binary Words
A. M. Shur, Growth properties of power-free languages, Computer Science Review, Vol. 6 (2012), 187-208.
A. M. Shur, Numerical values of the growth rates of power-free languages, arXiv:1009.4415 [cs.FL], 2010.
FORMULA
Let L = lim a(n)^(1/n); then L exists since a(n) is submultiplicative. 1.2206318 < L < 1.22064482 (Shur 2012); the gap between the bounds can be made less than any given constant. Empirically, the upper bound is precise: L=1.2206448... . - Arseny Shur, Apr 26 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
Ralf Stephan, Apr 10 2003
EXTENSIONS
Changed name by Jeffrey Shallit, Sep 26 2014
STATUS
approved