The format follows that of lists in Maple: each word is a set of numbers separated by commas and surrounded by brackets. Each n-Brinkhuis triple is enclosed by another pair of brackets. These triples do not necessarily be the special n-Brinkhuis triples as discussed in Improved Bounds on the Number of Ternary Square-Free Words by Uwe Grimm, although some of them are. In fact, the restriction of the reversion of a word being in the same triple is removed.

[ [0, 1, 2, 0, 2, 1, 2, 0, 1, 0, 2, 1, 0, 1, 2, 0, 1, 0, 2, 1, 2, 0, 1, 2, 1, 0, 2, 1, 2, 0, 2, 1, 0],     [0, 1, 2, 0, 2, 1, 0, 2, 0, 1, 2, 1, 0, 1, 2, 0, 1, 0, 2, 1, 2, 0, 1, 2, 1, 0, 2, 1, 2, 0, 2, 1, 0],     [0, 1, 2, 0, 2, 1, 2, 0, 1, 0, 2, 0, 1, 2, 1, 0, 1, 2, 0, 2, 1, 0, 1, 2, 1, 0, 2, 1, 2, 0, 2, 1, 0],     [0, 1, 2, 0, 2, 1, 0, 2, 0, 1, 2, 1, 0, 2, 1, 2, 0, 1, 0, 2, 1, 0, 1, 2, 1, 0, 2, 1, 2, 0, 2, 1, 0],     [0, 1, 2, 0, 2, 1, 2, 0, 1, 0, 2, 0, 1, 2, 1, 0, 1, 2, 0, 2, 1, 0, 2, 0, 1, 0, 2, 1, 2, 0, 2, 1, 0],     [0, 1, 2, 0, 2, 1, 2, 0, 1, 0, 2, 0, 1, 2, 0, 2, 1, 0, 1, 2, 1, 0, 2, 0, 1, 0, 2, 1, 2, 0, 2, 1, 0],     [0, 1, 2, 0, 2, 1, 2, 0, 1, 2, 1, 0, 1, 2, 0, 2, 1, 0, 1, 2, 1, 0, 2, 0, 1, 0, 2, 1, 2, 0, 2, 1, 0],     [0, 1, 2, 0, 2, 1, 2, 0, 1, 2, 1, 0, 2, 1, 2, 0, 1, 0, 2, 1, 0, 1, 2, 0, 1, 0, 2, 1, 2, 0, 2, 1, 0],     [0, 1, 2, 0, 2, 1, 0, 2, 0, 1, 2, 1, 0, 2, 1, 2, 0, 1, 2, 1, 0, 1, 2, 0, 1, 0, 2, 1, 2, 0, 2, 1, 0],     [0, 1, 2, 0, 2, 1, 2, 0, 1, 2, 1, 0, 2, 1, 2, 0, 1, 0, 2, 1, 0, 1, 2, 1, 0, 2, 0, 1, 2, 0, 2, 1, 0],     [0, 1, 2, 0, 2, 1, 2, 0, 1, 2, 1, 0, 1, 2, 0, 1, 0, 2, 1, 2, 0, 1, 2, 1, 0, 2, 0, 1, 2, 0, 2, 1, 0],     [0, 1, 2, 0, 2, 1, 2, 0, 1, 0, 2, 1, 0, 1, 2, 1, 0, 2, 1, 2, 0, 1, 2, 1, 0, 2, 0, 1, 2, 0, 2, 1, 0] ]