login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A342379
Expansion of e.g.f. (exp(x)-1)*(exp(x) - x^3/6 - x^2/2 - x - 1).
2
0, 0, 0, 0, 0, 5, 21, 63, 162, 381, 847, 1815, 3796, 7813, 15913, 32191, 64838, 130237, 261155, 523127, 1047224, 2095589, 4192509, 8386559, 16774890, 33551805, 67105911, 134214423, 268431772, 536866821, 1073737297, 2147478655, 4294961806, 8589928573, 17179862603
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.
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
Sequence in context: A362573 A196631 A357723 * A146822 A146223 A181093
KEYWORD
nonn,easy
AUTHOR
Enrique Navarrete, Mar 09 2021
STATUS
approved