Tightening the bounds on the Baron’s Omni-sequence

“The Baron’s Omni-sequence”, first defined by Khovanova and Lewis (2011) [5], is a sequence that gives for each n the minimum number of weighings on balance scales that can verify the correct labeling of n identically-looking coins with distinct integer weights between 1 gram and n grams . , Khovanova and Lewis provide upper and lower bounds for this sequence, where the upper bound follows from the use of a particular algorithmic scheme. We continue this investigation by providing new algorithms that provide better upper bounds, within a factor of 2 from the lower bounds (improving on Khovanova and Lewis’s 2.96 ). Furthermore, we show that these new algorithms are, under certain criteria, optimal within the framework of the present algorithmic scheme. We also discuss directions that may provide improvements within or over the scheme.