Recursion, Catalan Numbers & Generating Functions · Challenge problem

How many binary strings of length $12$ have no isolated $1$? (An isolated $1$ is a $1$ whose neighbours, where they exist, are both $0$; so every $1$ must be next to another $1$.)