We give three new partition theorems of the classical Rogers-Ramanujan type which are very much in the style of MacMahon. These are a continuation of four theorems of the same kind given recently by the second author. One of these new theorems, very similar to one of the original Rogers-Ramanuj an - MacMahon type theorems is as follows: Let C(n) denote the number of partitions of n into parts congruent to ±2, ± 3, ±4, ± 5, ±6, ±7 (mod 20). Let D(n) denote the number of partitions of n of the form n = b1 + b2 + … + bt, where bt ≧ 2, bt ≧ bi + 1 and if 1 ≦ i ≦ [(t - 2)/2], bi - bi + 1 ≧ 2. Then C(n) = D(n).