Algoritms for enumeration of single-transition serial sequences

Sets of $n$-valued single-transition serial sequences consisting of two serial subsequences (an increasing one and a decreasing one) determined by constraints on the number of series and on their lengths and heights are considered.
Enumeration problems for sets of finite sequences in which the difference in height between the neighboring series is not less than some given value are solved. Algorithms that assign smaller numbers to the lexicographically lower-order sequences and smaller numbers to the lexicographically higher-order sequences are obtained.