All non-isomorphic CA^*₁(6,3,3)s, the number of runs, a lower bound for D-efficiency and D-efficiency ordering (.n means that the design ranks number n in the D-efficiency ordering):

Covering Array             Number of Runs             Lower Bound and Ordering  
CA^*₁(6,3,3).1                         33                                   (97.4024%).1