residual set: |R cap [1,10^6]| = 16703 (note: 16,703); |R cap [1,2000)| = 39 (note: 39); smallest ten [45, 117, 153, 245, 261, 333, 369, 405, 477, 549]
certificate file: header 'n;family;networks', 16703 lines
spanning trees of W_2, W_3, W_4: 5, 16, 45 (note: 5, 16, 45)
family counts {'F1': 15330, 'F2': 771, 'F3': 602} (note: F1 15,330, F2 771, F3 602); F1 share 91.78%
certified numbers distinct: True; equal to R cap [1,10^6]: True
lines failing (leaf coprimality, tree sum, Lambda formula): 0 []
certificates with a network pair entry > 1000: 0: []
Table 1 and the examples 79037, 84113 agree with the file: True
F1 pairs of Table 1: 117 (6, 9), 261 (6, 15), 405 (9, 18) (note: (6,9), (6,15), (9,18))
factorizations: 79037 = {7: 2, 1613: 1}, 84113 = {19: 2, 233: 1}, 2313 = {3: 2, 257: 1}
time 0.6 s
