The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A143284 Number of binary words of length n containing at least one subword 100001 and no subwords 10^{i}1 with i<4. 2
 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 7, 11, 17, 25, 35, 48, 66, 92, 129, 180, 249, 342, 468, 640, 875, 1195, 1629, 2216, 3009, 4080, 5526, 7477, 10107, 13649, 18415, 24823, 33433, 44995, 60513, 81330, 109241, 146644, 196742, 263813, 353570, 473640, 634201 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,8 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (2,-1,0,0,1,0,-1,0,0,0,-1). FORMULA G.f.: x^6/((x^5+x-1)*(x^6+x-1)). a(n) = A003520(n+4) - A005708(n+5). a(n) = 2*a(n-1)-a(n-2)+a(n-5)-a(n-7)-a(n-11). - Vincenzo Librandi, Jun 05 2013 EXAMPLE a(7)=2 because 2 binary words of length 7 have at least one subword 100001 and no subwords 10^{i}1 with i<4: 0100001, 1000010. MAPLE a:= n-> coeff(series(x^6/((x^5+x-1)*(x^6+x-1)), x, n+1), x, n): seq(a(n), n=0..60); MATHEMATICA CoefficientList[Series[x^6 / ((x^5 + x - 1) (x^6 + x - 1)), {x, 0, 50}], x] (* Vincenzo Librandi, Jun 04 2013 *) PROG (MAGMA) [n le 6 select 0 else n le 11 select n-6 else 2*Self(n-1)-Self(n-2) +Self(n-5)-Self(n-7)-Self(n-11): n in [1..60]]; // Vincenzo Librandi, Jun 05 2013 CROSSREFS Cf. A003520, A005708, 4th column of A143291. Sequence in context: A006456 A018134 A245823 * A343305 A346076 A339357 Adjacent sequences:  A143281 A143282 A143283 * A143285 A143286 A143287 KEYWORD nonn,easy AUTHOR Alois P. Heinz, Aug 04 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 10 06:08 EDT 2022. Contains 356029 sequences. (Running on oeis4.)