An Improved Lower Bound for $n$-Brinkhuis $k$-Triples

Michael Sollami, Craig C. Douglas, Manfred Liebmann

Let $s_n$ be the number of words consisting of the ternary alphabet consisting of the digits 0, 1, and 2 such that no subword (or factor) is a square (a word concatenated with itse…