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 A164415 #16 Oct 12 2017 14:55:52 %S A164415 1,2,4,8,13,22,38,65,112,193,332,572,985,1696,2921,5030,8662,14917, %T A164415 25688,44237,76180,131188,225917,389048,669973,1153750,1986854, %U A164415 3421529,5892160,10146793,17473628,30091052,51819313,89237200,153673937,264639398,455731222 %N A164415 Number of binary strings of length n with no substrings equal to 0000, 0001, or 1100. %H A164415 Alois P. Heinz, <a href="/A164415/b164415.txt">Table of n, a(n) for n = 0..2000</a> (first 500 terms from R. H. Hardin) %H A164415 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (1, 1, 1, -1). %F A164415 G.f.: -(x+1)*(x^5-x^2-1)/(x^4-x^3-x^2-x+1). - _R. J. Mathar_, Nov 28 2011 %K A164415 nonn,easy %O A164415 0,2 %A A164415 _R. H. Hardin_, Aug 14 2009 %E A164415 Edited by _Alois P. Heinz_, Oct 12 2017