The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #7 May 10 2013 12:44:47
%S 1,2,4,8,16,32,64,127,251,496,981,1940,3837,7590,15015,29704,58763,
%T 116249,229971,454942,899991,1780410,3522102,6967611,13783703,
%U 27267665,53942368,106711708,211102869,417615105,826148769,1634332138
%N Number of (0,1)-strings of length n with no occurrences of the substrings 10101101 and 1110101.
%D I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, Wiley, N.Y., 1983, (Example 2.8.11).
%F G.f.: (1+x^5+x^6+x^7-x^9)/(1+x^5-x^6-x^9-2*x-x^8+x^10). a(n) = 2*a(n-1)-a(n-5)+a(n-6)+a(n-8)+a(n-9)-a(n-10).
%Y Cf. A062258, A062259.
%K nonn
%O 0,2
%A _Vladeta Jovovic_, Jun 14 2001