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!)
A164439 Number of binary strings of length n with no substrings equal to 0000 0110 or 1001 1

%I

%S 13,21,34,56,92,151,247,405,663,1087,1780,2918,4779,7833,12830,21027,

%T 34444,56446,92469,151528,248242,406776,666426,1091993,1789068,

%U 2931473,4802866,7869607,12893569,21126181,34613470,56713903,92921589,152250422

%N Number of binary strings of length n with no substrings equal to 0000 0110 or 1001

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

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

%F G.f. -x^4*(13+8*x+14*x^3-3*x^4+8*x^5) / ( -1+x+x^2-x^3+2*x^4-x^5+x^6 ). - R. J. Mathar, Jan 19 2011

%t LinearRecurrence[{1,1,-1,2,-1,1},{13,21,34,56,92,151},40] (* _Harvey P. Dale_, Dec 13 2014 *)

%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 September 28 04:24 EDT 2021. Contains 347698 sequences. (Running on oeis4.)