login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A164425 Number of binary strings of length n with no substrings equal to 0000 0010 or 1111 1

%I

%S 13,22,37,62,105,177,298,502,846,1426,2403,4049,6823,11498,19376,

%T 32651,55021,92718,156243,263291,443681,747663,1259915,2123130,

%U 3577765,6029024,10159732,17120542,28850461,48616982,81926280,138057015,232645000

%N Number of binary strings of length n with no substrings equal to 0000 0010 or 1111

%H R. H. Hardin, <a href="/A164425/b164425.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,0,1,1,1).

%F G.f. -x^4*(13+9*x+15*x^2+12*x^3+8*x^4) / ( -1+x+x^3+x^4+x^5 ). - R. J. Mathar, Dec 01 2011

%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 December 17 02:35 EST 2018. Contains 318192 sequences. (Running on oeis4.)