Geodesic
New lower bound on the number of ternary square-free words
Journal of integer sequences, Tome 6 (2003) no. 3
A new lower bound on the number of $n$-letter ternary square-free words is presented: 110^n/42, which improves the previous best result of 65^n/40.
Classification : 05A20, 68R15
Keywords: square-free, ternary, word, brinkhuis triple (Concerned with sequence 
@article{JIS_2003__6_3_a1,
     author = {Sun,  Xinyu},
     title = {New lower bound on the number of ternary square-free words},
     journal = {Journal of integer sequences},
     year = {2003},
     volume = {6},
     number = {3},
     zbl = {1024.05004},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/JIS_2003__6_3_a1/}
}
TY  - JOUR
AU  - Sun,  Xinyu
TI  - New lower bound on the number of ternary square-free words
JO  - Journal of integer sequences
PY  - 2003
VL  - 6
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/JIS_2003__6_3_a1/
LA  - en
ID  - JIS_2003__6_3_a1
ER  - 
%0 Journal Article
%A Sun,  Xinyu
%T New lower bound on the number of ternary square-free words
%J Journal of integer sequences
%D 2003
%V 6
%N 3
%U http://geodesic.mathdoc.fr/item/JIS_2003__6_3_a1/
%G en
%F JIS_2003__6_3_a1
Sun,  Xinyu. New lower bound on the number of ternary square-free words. Journal of integer sequences, Tome 6 (2003) no. 3. http://geodesic.mathdoc.fr/item/JIS_2003__6_3_a1/