For positive integers $n$ and $r$, we consider $n$-vertex graphs with the maximum number of $r$-edge-colorings with no copy of a triangle where exactly two colors appear. We prove that, if $2 \leq r \leq 26$ and $n$ is sufficiently large, the maximum is attained by the bipartite Turán graph $T_2(n)$ on $n$ vertices. This is best possible, as $T_2(n)$ is not extremal for $r \geq 27$ colors and $n \geq 3$.