n=27: k(A_n) = 1526, p(n) = 3010, primes [3425629, 3425627, 3425621, 3425603, 3425581, 3425579]; S_n table 1.0 s
   degrees = hook length formula: True; S_n column orthogonality mod p: True; row sums: True; top Garner digit 0: True
   perfect matching for every class C: True; max |T(C)| = 227; classes with no vanishing irreducible character: 2
   Theorem B: T(C) = E(mu,n) for the five mu: True; permutation of Remark 4.5 valid: True
   Theorem C: Lemma 5.3 (equal residues across C+-, halves of K and L): True; rule of Remark 5.7: True; permutation of the proof valid: True
   (754.5 s)
summary: n, k(A_n), max |T(C)|, perfect matching for every C
   27 1526 227 True
