Systematic generation of all nonequivalent closest-packed stacking sequences of length N using group theory

An algorithm has been developed that generates all of the nonequivalent clo sest-packed stacking sequences of length N. There are 2(N) + 2(-1)(N) diffe rent labels for closest-packed stacking sequences of length N using the sta ndard A, B, C notation. These labels are generated using an ordered binary tree. As different labels can describe identical structures, we have derive d a generalized symmetry group, Q similar or equal to D-N x S-3, to sort th ese into crystallographic equivalence classes. This problem is shown to be a constrained version of the classic three-colored necklace problem.