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!)
A164507 Number of binary strings of length n with no substrings equal to 0011, 0110, or 1100. 1

%I

%S 1,2,4,8,13,22,37,63,106,180,304,515,871,1475,2496,4226,7153,12110,

%T 20500,34706,58754,99469,168396,285091,482651,817121,1383372,2342034,

%U 3965038,6712778,11364682,19240337,32573779,55147244,93364021,158064880,267603180

%N Number of binary strings of length n with no substrings equal to 0011, 0110, or 1100.

%H Alois P. Heinz, <a href="/A164507/b164507.txt">Table of n, a(n) for n = 0..2000</a> (first 500 terms from R. H. Hardin)

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

%F G.f.: -(x^8+x^7+x^6+x^5+2*x^4-x^3-1)/(x^7+x^5-x^4+x^3-2*x+1). - _R. J. Mathar_, Jan 19 2011

%K nonn,easy

%O 0,2

%A _R. H. Hardin_, Aug 14 2009

%E Edited by _Alois P. Heinz_, Feb 14 2018

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 October 21 17:02 EDT 2021. Contains 348155 sequences. (Running on oeis4.)