The number of Wyckoff sequences of a given subdivision complexity is calculated by means of a generating polynomial approach and a dynamic programming approach. The result depends on the choice of space-group symmetry (which is obligatory) and Wyckoff sequence length (which is optional). It also takes into account specified values for the total number of combinatorial and coordinational degrees of freedom, thereby representing crystal structures of invariant subdivision complexity.