Let $f_1, \ldots, f_6$ be the top faces rolled, independent and uniform over the six faces. Sticker $i$ goes on face $f_i$ and ends up visible exactly when $f_j \ne f_i$ for all $j \gt i$ (sticker $6$ is always visible). So the conditioning event is $f_3, f_4, f_5, f_6 \ne f_2$ and $f_5, f_6 \ne f_4.$ Counting choices in the order $f_1, f_2, f_3, f_4, f_5, f_6$ gives $6 \cdot 6 \cdot 5 \cdot 5 \cdot 4 \cdot 4 = 14400$ sequences out of $6^6.$

A face is blank exactly when it never appears among $f_1, \ldots, f_6,$ so exactly one blank face means the sequence takes exactly $5$ distinct values, i.e. there is exactly one coincidence $f_i = f_j$ with $i \lt j$ and all other values distinct. The coincidence must not violate the conditioning: pairs $(2, j)$ and $(4, 5),$ $(4, 6)$ are forbidden, leaving the $9$ pairs $(1,2),$ $(1,3),$ $(1,4),$ $(1,5),$ $(1,6),$ $(3,4),$ $(3,5),$ $(3,6),$ $(5,6).$ For each allowed pair, the five distinct values can be assigned in $6 \cdot 5 \cdot 4 \cdot 3 \cdot 2 = 720$ ways, and every constraint holds automatically because the only repeated value occupies an allowed pair. That gives $9 \cdot 720 = 6480$ sequences.

Therefore $p = \frac{6480}{14400} = \frac{9}{20},$ and $m + n = 9 + 20 = 29.$