login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A164493 Number of binary strings of length n with no substrings equal to 0010 0101 or 1001 1

%I

%S 13,22,38,65,111,190,326,559,958,1642,2814,4822,8263,14160,24266,

%T 41585,71265,122128,209292,358665,614646,1053322,1805084,3093384,

%U 5301153,9084622,15568378,26679633,45721063,78352486,134273170,230104815

%N Number of binary strings of length n with no substrings equal to 0010 0101 or 1001

%H R. H. Hardin, <a href="/A164493/b164493.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 (2,-1,1,-1,1,0,1).

%F G.f. -x^4*(13-4*x+7*x^2-2*x^3+10*x^4+4*x^5+8*x^6) / ( -1+2*x-x^2+x^3-x^4+x^5+x^7 ). - R. J. Mathar, Jan 19 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 15:00 EST 2022. Contains 358510 sequences. (Running on oeis4.)