Let \(\overline{p}(n)\) denote the number of overpartitions of n. In this note, we find some congruences for this partition function that appear to have been overlooked in the existing literature. For example, we prove that for all \(n \ge 0\) \(\begin{aligned} \overline{p}\left( 648n+594\right) \equiv 0 \pmod {2^7}. \end{aligned}\) We also propose a conjectural congruence modulo \(5^2\) , which is one in a handful of its type. Our approach is elementary dissection techniques.
