login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A164408 Number of binary strings of length n with no substrings equal to 0000 0001 or 0011. 1

%I

%S 13,23,40,68,118,203,349,602,1036,1784,3073,5291,9112,15692,27022,

%T 46535,80137,138002,237652,409256,704773,1213679,2090056,3599252,

%U 6198214,10673843,18381253,31654058,54510940,93872408,161656153,278385443

%N Number of binary strings of length n with no substrings equal to 0000 0001 or 0011.

%H R. H. Hardin, <a href="/A164408/b164408.txt">Table of n, a(n) for n=4..500</a>

%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1, 1, -1).

%F G.f.: x^4*(13+10*x+4*x^2-8*x^3) / ( 1-x-x^2-x^3+x^4 ). - _R. J. Mathar_, Nov 28 2011

%t CoefficientList[Series[(13 + 10*x + 4*x^2 - 8*x^3)/(1 - x - x^2 - x^3 + x^4), {x, 0, 50}], x] (* _Wesley Ivan Hurt_, Jan 10 2017 *)

%t LinearRecurrence[{1,1,1,-1}, {13, 23, 40, 68}, 50] (* _G. C. Greubel_, Sep 19 2017 *)

%o (PARI) x='x+O('x^50); Vec(x^4*(13+10*x+4*x^2-8*x^3)/(1-x-x^2-x^3+x^4)) \\ _G. C. Greubel_, Sep 19 2017

%K nonn

%O 4,1

%A _R. H. Hardin_, Aug 14 2009

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 25 11:07 EDT 2020. Contains 334592 sequences. (Running on oeis4.)