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

%I

%S 13,21,33,53,84,135,217,352,570,925,1498,2427,3927,6355,10279,16630,

%T 26902,43527,70424,113952,184379,298341,482729,781082,1263815,2044899,

%U 3308703,5353590,8662271,14015848,22678105,36693960,59372075,96066068

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

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

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

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

%o (PARI) a(n)=([0,1,0,0,0,0,0; 0,0,1,0,0,0,0; 0,0,0,1,0,0,0; 0,0,0,0,1,0,0; 0,0,0,0,0,1,0; 0,0,0,0,0,0,1; 1,0,-1,2,-2,0,2]^(n-4)*[13;21;33;53;84;135;217])[1,1] \\ _Charles R Greathouse IV_, Aug 05 2015

%K nonn,easy

%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 October 20 03:04 EDT 2021. Contains 348099 sequences. (Running on oeis4.)