OFFSET
0,6
COMMENTS
a(n) is the number of binary strings of length n that contain at least four 0's but not all digits are 0.
a(n) is also the number of proper subsets with at least four elements of an n-element set.
LINKS
Index entries for linear recurrences with constant coefficients, signature (6,-14,16,-9,2).
FORMULA
a(n) = 2^n - Sum_{i={0..3,n}} binomial(n,i).
G.f.: x^5*(2*x^3-7*x^2+9*x-5)/((2*x-1)*(x-1)^4). - Alois P. Heinz, Mar 09 2021
EXAMPLE
a(7) = 63 since the strings are the 35 permutations of 0000111, the 21 permutations of 0000011, and the 7 permutations of 0000001.
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Enrique Navarrete, Mar 09 2021
STATUS
approved