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 A234592 #21 Sep 08 2022 08:46:06
%S A234592 1,2,4,8,16,32,64,128,256,512,1024,2047,4092,8180,16352,32688,65344,
%T A234592 130624,261120,521984,1043457,2085893,4169745,8335410,16662664,
%U A234592 33309024,66585456,133105760,266081280,531902207,1063283962,2125527529,4248975286,8493793063
%N A234592 Number of binary words of length n which have no 0^b 1 1 0^a 1 0 1 0^b - matches, where a=b=2.
%H A234592 Alois P. Heinz, <a href="/A234592/b234592.txt">Table of n, a(n) for n = 0..1000</a>
%H A234592 B. K. Miceli, J, Remmel, <a href="http://puma.dimai.unifi.it/23_3/miceli_remmel.pdf">Minimal Overlapping Embeddings and Exact Matches in Words</a>, PU. M. A., Vol. 23 (2012), No. 3, pp. 291-315.
%H A234592 <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (2,0,0,0,0,0,0,0,-1,1,1).
%F A234592 G.f.: (1+x^9+x^10)/(1-2*x+x^9-x^10-x^11). - _Alois P. Heinz_, Jan 08 2014
%p A234592 a:= n-> coeff(series(-(x^10+x^9+1)/(x^11+x^10-x^9+2*x-1), x, n+1), x, n):
%p A234592 seq(a(n), n=0..40); # _Alois P. Heinz_, Jan 08 2014
%t A234592 a[n_ /; n<=10]:= 2^n; a[n_]:=a[n] =2*a[n-1] -a[n-9] +a[n-10] +a[n-11]; Table[a[n], {n, 0, 40}] (* _Jean-François Alcover_, Mar 18 2014 *)
%t A234592 LinearRecurrence[{2,0,0,0,0,0,0,0,-1,1,1}, {1,2,4,8,16,32,64,128,256, 512,1024}, 40] (* _Harvey P. Dale_, May 17 2018 *)
%o A234592 (PARI) my(x='x+O('x^40)); Vec((1+x^9+x^10)/(1-2*x+x^9-x^10-x^11)) \\ _G. C. Greubel_, Sep 14 2019
%o A234592 (Magma) R<x>:=PowerSeriesRing(Integers(), 40); Coefficients(R!( (1+x^9+x^10)/(1-2*x+x^9-x^10-x^11) )); // _G. C. Greubel_, Sep 14 2019
%o A234592 (Sage)
%o A234592 def A234592_list(prec):
%o A234592 P.<x> = PowerSeriesRing(ZZ, prec)
%o A234592 return P((1+x^9+x^10)/(1-2*x+x^9-x^10-x^11)).list()
%o A234592 A234592_list(40) # _G. C. Greubel_, Sep 14 2019
%o A234592 (GAP) a:=[1,2,4,8,16,32,64,128,256,512,1024];; for n in [12..40] do a[n]:=2*a[n-1]-a[n-9]+a[n-10]+a[n-11]; od; a; # _G. C. Greubel_, Sep 14 2019
%K A234592 nonn,easy
%O A234592 0,2
%A A234592 _N. J. A. Sloane_, Jan 01 2014
%E A234592 a(17)-a(33) from _Alois P. Heinz_, Jan 08 2014