We study the languages 𝔏^𝔭 ⊂ {0,1}^* of binary words w avoiding a given pattern 𝔭 such that |w|₀ ≤ |w|₁ for every w ∈ 𝔏^𝔭, where |w|₀ and |w|₁ correspond to the number of 0-bits and 1-bits in the word w, respectively. In particular, we concentrate on patterns 𝔭 related to the concept of Riordan arrays. These languages are not regular, but can be enumerated by algebraic generating functions corresponding to many integer sequences that were previously unlisted in the On-Line Encyclopedia of Integer Sequences. We give explicit formulas for these generating functions expressed in terms of the autocorrelation polynomial of 𝔭, and also give explicit formulas for the coefficients of some particular patterns, algebraically and combinatorially.