n=26: k(A_n) = 1236, p(n) = 2436, primes [3807901, 3807889, 3807883, 3807877, 3807871]; S_n table 0.8 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)| = 160; classes with no vanishing irreducible character: 3
   Theorem B: T(C) = E(mu,n) for the five mu: True; permutation of Remark 4.5 valid: True
   (309.5 s)
summary: n, k(A_n), max |T(C)|, perfect matching for every C
   26 1236 160 True
