There are more than 2n/17 n-letter ternary square-free words

Journal of Integer Sequences

Volumn 1, Issue , 1998, Pages

  Ekhad, Shalosh B ^a   Zeilberger, Doron ^a  

^a Temple University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENTROPY; MATHEMATICAL MODELS; NUMBER THEORY; THEOREM PROVING;

INTEGER SEQUENCES; MATHEMATICAL CONSTANTS; PALINDROMES; SQUARE-FREE WORDS;

INTEGER PROGRAMMING;

EID: 0010004382     PISSN: 15307638     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (6)

1. M. Baake, V. Elser and U. Grimm, The entropy of square-free words, Mathl. Comput. Modelling 26 (1997) 13-26.
2. F.-J. Brandenburg, Uniformly growing kth power-free homomorphisms, Theor. Comp. Sci. 23 (1983) 69-82.
3. J. Brinkhuis, Non-repetitive sequences on three symbols, Quart. J. Math. Oxford (2) 34 (1983) 145-149.
4. S. Finch, Favorite Mathematical Constants Website, Essay on words.
5. N.J.A. Sloane and S. Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995. See also the On-Line Encyclopedia of Integer Sequences.
6. N.J.A. Sloane and S. Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995. See also the On-Line Encyclopedia of Integer Sequences.