I assume you want EXACTLY one pair.

I would look at it as 4 slots, each a toss.

Putting the match first there are 6 ways of having a pair in the first two positions.

(1,1).... (6,6) then for the last two tosses, there are 5 choose 2 numbers to select which is 10.

Now switching the positions, so that the pair need not land in the first two spots

there are 4!/(1!1!2!) ways of rewriting this sequence