Character-Limited Patterns?

[-Job-]

It's possible to determine the subset of characters which maximizes repeated word sequences, but the right questions would need to be asked.

For example we can expect that a smaller subset will typically result in more repeated sequences, so it would be preferable to ask which subset of n characters yields the most repetition, starting with large n.

There is a trade off between subset size and the number of repeated sequences - the former should not be too small and the latter should not be too large.

It's not clear how the results would be interpreted. I suspect the brute-force search would be the easy part.