The conjecture for the number of left braces of order $p^2q$

Let $b(n)$ denote the number of non-isomorphic left braces of size $n$. Let $p,q$ be prime numbers such that $p<q$ and $q\not\equiv1\bmod p$. The order-$p^2q$ counting conjecture. Then

$$b(p^2q)=4.$$

The conjecture concerns the enumeration of left braces by finite size. The supplied context gives no resolution evidence for this claim, so its general status is open.