The Shannon function for calculating the Arnold complexity of length $2^n$ binary words for arbitrary $n$

The exact value of the Shannon function for fast calculating the Arnold complexity of length $2^n$ binary words is obtained for $n=m^2$, $n=m^2+m$, and $n=m^2+2m$, $m\geq2$. Thus the exact value of the Shannon function is determined for an arbitrary $n$. Bibliogr. 6.