Strategically Significant Board Runouts

I am trying to figure out a way to calculate how many strategically significant board runouts there are. I know there are 7,462 five card hand variations - but that's not what I'm looking for.

Here is an example:

Ad Kd 3h 2h 8c ... I could translate this into: A1 K1 3(2) 2(2) 8(3) with the numbers representing the suits in the order which they appear. For example if the board was Ad Ks 3h 2h 8c ... A1 K2 3(3) 2(3) 8(4) .

That seems to be the best way to avoid coming up with duplicate boards from a perspective of strategic significance, but not really sure how to calculate the number of possibilities. I wrote some Python code that came out to 204,087 different boards - but the problem is that it includes multiples of the same boards, ex:

A1, A2, A3, A4, T1 (strategically significant)
A1, A2, A3, A4, T2 (same as board 1)
A1, A2, A3, A4, T3 (same as board 1)

A1, A2, A3, A4, T4 (strategically significant)

Does anyone know how you could go about calculating this properly?