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

A164414
Number of binary strings of length n with no substrings equal to 0000, 0001, or 1010.
2
1, 2, 4, 8, 13, 22, 37, 63, 107, 181, 307, 521, 883, 1497, 2539, 4305, 7299, 12377, 20987, 35585, 60339, 102313, 173483, 294161, 498787, 845753, 1434075, 2431649, 4123155, 6991305, 11854603, 20100913, 34083523, 57792729, 97994555, 166161601, 281747059
OFFSET
0,2
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..2000 (terms n=4..500 from R. H. Hardin)
FORMULA
From R. J. Mathar, Nov 30 2011: (Start)
a(n) = 13*A077949(n-4) + 9*A077949(n-5) + 15*A077949(n-6).
G.f.: (x^6-x^5-x^4-2*x^3-2*x^2-x-1)/(2*x^3+x-1).
(End)
CROSSREFS
Cf. A077949.
Sequence in context: A164437 A164428 A164507 * A164411 A164443 A074467
KEYWORD
easy,nonn
AUTHOR
R. H. Hardin, Aug 14 2009
EXTENSIONS
a(0)-a(3) from Alois P. Heinz, Jun 10 2021
STATUS
approved