This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A062257 #7 May 10 2013 12:44:47 %S A062257 1,2,4,8,16,32,64,127,251,496,981,1940,3837,7590,15015,29704,58763, %T A062257 116249,229971,454942,899991,1780410,3522102,6967611,13783703, %U A062257 27267665,53942368,106711708,211102869,417615105,826148769,1634332138 %N A062257 Number of (0,1)-strings of length n with no occurrences of the substrings 10101101 and 1110101. %D A062257 I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, Wiley, N.Y., 1983, (Example 2.8.11). %F A062257 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 A062257 Cf. A062258, A062259. %K A062257 nonn %O A062257 0,2 %A A062257 _Vladeta Jovovic_, Jun 14 2001