# I don't want $$101$$ and $$111$$.

Let $$a_{n}$$ be the number of words of $$0-1$$ strings of length $$n$$ such that neither $$101$$ nor $$111$$ occur as 3-digit blocks. Find $$a_{16}$$.

Note: This is an old IMO problem.

×