n_j (A) first 30: [2, 5, 12, 21, 34, 50, 69, 92, 119, 149, 182, 219, 259, 302, 349, 399, 452, 508, 568, 631, 697, 767, 840, 917, 997, 1080, 1167, 1257, 1350, 1447]
n_j (B) first 30: [3, 11, 25, 45, 72, 106, 146, 193, 247, 308, 376, 451, 534, 624, 721, 825, 936, 1054, 1180, 1313, 1453, 1601, 1756, 1919, 2089, 2267, 2452, 2645, 2846, 3054]
n_J(A) = 5889,  n_J(B) = 12885
exact recheck (A1),(A2) for the claim-rule n_j: bad = 0
Theorem A, p = z: nonzero 112, violations 0, disc hits 0
