n=4 |A_n|=12 classes=4 expansive_for_all_C=False max|T(C)|=4
   violator for C=((3, 1), 1): S = [((1, 1, 1, 1), 0), ((2, 2), 0)] (k(S)=2), classes in SC = [((3, 1), 1)] (k=1)
   violator for C=((3, 1), -1): S = [((1, 1, 1, 1), 0), ((2, 2), 0)] (k(S)=2), classes in SC = [((3, 1), -1)] (k=1)
n=5 |A_n|=60 classes=5 expansive_for_all_C=True max|T(C)|=3
n=6 |A_n|=360 classes=7 expansive_for_all_C=True max|T(C)|=3
n=7 |A_n|=2520 classes=9 expansive_for_all_C=True max|T(C)|=3
   Lemma 7.0 (halves do not matter next to an n-cycle): True; rule l(K)+l(L)<=n+1 for K,L != 1, types != (n): True
n=8 |A_n|=20160 classes=14 expansive_for_all_C=True max|T(C)|=5
n=9 |A_n|=181440 classes=18 expansive_for_all_C=True max|T(C)|=6
   Lemma 7.0 (halves do not matter next to an n-cycle): True; rule l(K)+l(L)<=n+1 for K,L != 1, types != (n): True
