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 A230216 #12 Aug 09 2019 12:13:09 %S A230216 1,2,4,8,16,32,56,104,192,352,648,1192,2192,4032,7416,13640,25088, %T A230216 46144,84872,156104,287120,528096,971320,1786536,3285952,6043808, %U A230216 11116296,20446056,37606160,69168512,127220728,233995400,430384640,791600768,1455980808 %N A230216 Number of binary strings of length n avoiding "squares" (that is, repeated blocks of the form xx) with |x| = 3. %H A230216 Colin Barker, <a href="/A230216/b230216.txt">Table of n, a(n) for n = 0..1000</a> %H A230216 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,1). %F A230216 a(n) = 8*A000073(n) for n >= 3. %F A230216 From _Colin Barker_, Aug 09 2019: (Start) %F A230216 G.f.: (1 + x + x^2 + x^3 + 2*x^4 + 4*x^5) / (1 - x - x^2 - x^3). %F A230216 a(n) = a(n-1) + a(n-2) + a(n-3) for n>5. %F A230216 (End) %e A230216 For n = 6 there are 8 strings omitted, namely 000000, 001001, ..., 111111, so a(6) = 64-8 = 56. %o A230216 (PARI) Vec((1 + x + x^2 + x^3 + 2*x^4 + 4*x^5) / (1 - x - x^2 - x^3) + O(x^40)) \\ _Colin Barker_, Aug 09 2019 %Y A230216 Cf. A000073, A022087, A229614, A230127, A230177. %K A230216 nonn,easy %O A230216 0,2 %A A230216 _Nathaniel Johnston_, Oct 11 2013