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”).

A164475
Number of binary strings of length n with no substrings equal to 0001 0101 or 1110.
1
13, 20, 30, 44, 63, 90, 128, 180, 253, 356, 498, 696, 975, 1362, 1900, 2656, 3709, 5172, 7222, 10084, 14063, 19626, 27400, 38220, 53325, 74436, 103850, 144880, 202207, 282146, 393620, 549304, 766509, 1069396, 1492238, 2082332, 2905311, 4053882
OFFSET
4,1
FORMULA
G.f.: -x^4*(-13-7*x-10*x^2+12*x^3+8*x^4) / ( (x-1)*(x^4+2*x^3-1) ). - R. J. Mathar, Jan 19 2011
MATHEMATICA
LinearRecurrence[{1, 0, 2, -1, -1}, {13, 20, 30, 44, 63}, 50] (* Harvey P. Dale, Jun 24 2021 *)
CROSSREFS
Sequence in context: A171143 A058016 A096277 * A164483 A164468 A164489
KEYWORD
nonn,easy
AUTHOR
R. H. Hardin, Aug 14 2009
STATUS
approved