## Problem of the Day #307: Counting Binary StringsJanuary 20, 2012

Posted by Saketh in : potd , trackback

Determine, in terms of $n$, the number of binary strings of length $2n-1$ that do not contain any substrings of length $n$ that are all $0$ or all $1$.