Consider bitstrings of the pattern 11....(16 dots). There are a total of 2^16 such bitstrings.
Now consider the pattern 011.....(15 dots). It is clear that this pattern and the previous pattern don't overlap, since this one starts with a 0. There are a total of 2^15 such bitstrings.
We can continue upto 000(16 zeros)11.
If we sum them up we get 2^0 + 2^1 + ... + 2^16 = 2^17 - 1 = 131,071.
However, according to the below Python program, the correct answer is 255,379:
m = 0
for k in range(0, 2 ** 18):
m += '11' in bin(k)
What am I doing wrong?
You have excluded patterns like $01011....$ where the first $1$ is not part of a $11$ sequence.