Optimal-solution count for odd-width two-row grids

Determine the number of optimal contamination configurations for the two-row grid graph G(2,2k+1) having exactly k-1 clean columns, and prove that the total number of optimal configurations satisfies α_{2,2k+1} = (k+1)(3k+2)2^{k-1} for every integer k ≥ 0.

Background

The paper studies α{n,m}, the number of minimum-cardinality initial contaminated sets that eventually contaminate every cell of the grid G(n,m). For two-row grids of odd width m=2k+1, the authors separate optimal configurations according to whether they contain k or k−1 clean columns. They derive the count (k+1)2k for configurations with exactly k clean columns, but state that counting the configurations with k−1 clean columns is more difficult. They conjecture a closed formula for the total sequence α{2,2k+1}, motivated by agreement with the OEIS sequence A084857 on the computed cases.

References

Counting the number of optimal solutions with exactly $k-1$ clean columns in a grid with $n=2$ and $m=2k+1$, where $k \geq 0$, seems to be more complicated. However, we believe that this number corresponds to the sequence A084857$(k+1)$ in the OEIS, and we therefore state the following conjecture.

— The Power Contamination Problem on Grids Revisited: Optimality, Combinatorics, and Links to Integer Sequences  (2509.12756 - Mehiri et al., 16 Sep 2025) in Section 3, immediately following the proposition counting solutions with exactly k clean columns