Altogether there are 2^n binary strings of length n. There is 1 that has no zeros, n that have one zero and C(n,2)=n*(n-1)/2 that have two zeros.

The answer is

2^n - 1 - n - n*(n-1)/2

  = 2^n - (n^2+n)/2 - 1