first five rows: [[1], [0, 1], [1, 1, 0], [0, 1, 2, 2], [5, 5, 4, 2, 0]]
N = 3000 B = 3064
diagonals checked: 3000  mismatches (i, finite-min, predicted, argmin row): 0
[]
mismatches with i <= N/2: []
first-attaining rows for i=1..40: [(1, 1), (2, 2), (3, 4), (4, 4), (5, 6), (6, 6), (7, 8), (8, 8), (9, 10), (10, 10), (11, 12), (12, 12), (13, 16), (14, 16), (15, 16), (16, 16), (17, 18), (18, 18), (19, 20), (20, 20), (21, 22), (22, 22), (23, 24), (24, 24), (25, 26), (26, 26), (27, 28), (28, 28), (29, 32), (30, 32), (31, 32), (32, 32), (33, 34), (34, 34), (35, 36), (36, 36), (37, 38), (38, 38), (39, 40), (40, 40)]
u_k finite vs formula mismatches for k with u_k < N/2: []  (checked k up to 399 )
Table 1 matches formula: True
