In sci.math, Richard Tobin provided the number of essentially different sequences of discrepancy at most 2, for lengths n from 1 to 75 inclusively. This leads to a function count(n) , for n = 1 … 75, which is the number of discrepancy D <= 2 sequences of length ‘n’, up to a change… Continue reading On counts of finite sequences with discrepancy <= 2