login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A164444
Number of binary strings of length n with no substrings equal to 0000 1001 or 1011.
1
13, 21, 32, 48, 72, 109, 165, 250, 378, 572, 865, 1309, 1980, 2996, 4532, 6857, 10373, 15694, 23742, 35920, 54341, 82213, 124376, 188168, 284672, 430677, 651557, 985730, 1491282, 2256132, 3413241, 5163821, 7812212, 11818924, 17880556, 27051089
OFFSET
4,1
FORMULA
G.f.: -x^4*(13+8*x-2*x^2+8*x^3) / ( -1+x+x^2-x^3+x^4 ). - R. J. Mathar, Jan 19 2011
MATHEMATICA
LinearRecurrence[{1, 1, -1, 1}, {13, 21, 32, 48}, 40] (* Harvey P. Dale, Sep 11 2017 *)
CROSSREFS
Sequence in context: A020440 A164458 A164452 * A164438 A164490 A164460
KEYWORD
nonn,easy
AUTHOR
R. H. Hardin, Aug 14 2009
STATUS
approved