On the number of 2n-p fractional factorials of resolution III

An algorithm is specified and demonstrated which will compute the total number of ways a 2ⁿ factorial design may be partitioned into 2^p mutually exclusive 2^n-p fractional factorial designs, each having resolution III. The results of its application to all designs possessing resolution III fractions for n=5,…,20 are also given.