This confirms Barker's conjecture decisively over the computed range and establishes minimality there, but is not a proof for all $n$; since the count-at-maximum comes from a max-plus (Viterbi) structure, a complete proof should extract the stabilized optimal-path linear subsystem and compare its characteristic polynomial with Barker's generating-function denominator.