The paper gives a special construction of those words (binary sequences) of length $n$ over the alphabet $\{0,1\}$ in which the subword $\underbrace{1010\dots10}_{2p}$ is forbidden for some natural number $p$, where $p$ is fixed. This number of words is counted in two different ways, which gives some new combinatorial identities.