A method for analyzing sequential data sets, similar to the permutation entropy one, is discussed. The characteristic features of this method are as follows: it preserves information about equal values in the embedding vectors; it is exempt of combinatorics; it delivers the same entropy value as does the permutation method, provided the embedding vectors have no equal components. In the case they do, obtained entropy is greater than the permutation one.