User blog comment:Boboris02/Large number combinatorics I:COX function/@comment-1605058-20170130220310/@comment-1605058-20170131195632

With two symbols, there are only \(2^3\) possible strings of three characters, and if we want them all to be different, there can be only at most \(2^3\) of them, from which there can only be \(2^3+2\) characters. Similarly COX(n) is at most \(n^3+3\).

Also, a note for the future: I'd recommend using symbols which can be more easily distinguished with a brief look, like 0 and 1 or O and X, instead of / and \.