Summary: We present a new series of examples of binary slowly synchronizing automata with a sink state. The reset threshold of the \(n\)-state automaton in this series is \(\frac{n^2}{4}+2n-9\). This improves on the previously known lower bound for the maximum reset threshold of binary synchronizing \(n\)-state automata with a sink state.