C1 done: triangle rows 1..1200; brute-force up/down permutation counts for n<=9
C2 done: v2(E_(2j-1)) = h(j) for j <= 600
C3 done: Lemma 1 checked on 720600 entries (n <= 1200)
C4 done: Lemma 2 formula checked on 62500 entries (even rows <= 500)
C5 done: m_i = G(i) (explicit witness + column minimum over rows <= 1200) for i <= 1200
C6 done: u_k (direct from triangle) = F(k) for k <= 399; F(1..18) = [2, 4, 4, 4, 8, 8, 8, 8, 10, 12, 12, 16, 16, 16, 16, 16, 18, 20]
    F(1..40) = [2, 4, 4, 4, 8, 8, 8, 8, 10, 12, 12, 16, 16, 16, 16, 16, 18, 20, 20, 20, 24, 24, 24, 24, 26, 28, 32, 32, 32, 32, 32, 32, 34, 36, 36, 36, 40, 40, 40, 40]
C7a done: v2(b_r) >= 2r - floor(log2(2r+1)) and v2(b_r/r!) >= 2 (r>=2) for r <= 600
    v2(b_r), r=0..20: [0, 1, 3, 4, 7, 8, 10, 11, 15, 16, 18, 19, 22, 23, 25, 26, 31, 32, 34, 35, 38]
C7b done: explicit formula for b_r agrees for r <= 40
C7c done: E^sgn_n = sum_k 2^-k sum_j (-1)^j C(k,j) (2j+1)^n for n <= 60
C8 done: Stern congruence checked on 4987 (s,m) pairs with 2m+2^s <= 1200

TOTAL FAILURES: 0
real 44.04
user 35.61
sys 0.31
