Systematic generation of ordered sequences using recurrence relations
E. S. Page · The Computer Journal · 1971
The calculation of the number of members of certain sets can be achieved by analysing recurrence relations. In this note, attention is drawn to the use of such recurrence relations for deriving orderings of the members of the sets in a systematic way and for answering questions about places in the orderings. Examples for certain types of restricted permutations are given.