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 A100132 #20 Oct 09 2021 06:46:24
%S A100132 1,2,4,8,18,44,112,288,740,1896,4848,12384,31624,80752,206208,526592,
%T A100132 1344784,3434272,8770368,22397568,57198368,146071744,373034240,
%U A100132 952645120,2432840256,6212924032,15866403584,40519208448,103476899968
%N A100132 a(n) = Sum_{k=0..floor(n/4)} C(n-2k,2k) * 2^(n-3k).
%C A100132 Binomial transform of 1,1,1,1,3,3,7,7,41,... (g.f. (1-x)(1+x)^2/(1-2x^2-x^4)).
%H A100132 Seiichi Manyama, <a href="/A100132/b100132.txt">Table of n, a(n) for n = 0..1000</a>
%H A100132 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-4,0,2)
%F A100132 G.f.: (1-2x)/((1-2x)^2-2x^4).
%F A100132 a(n) = 4*a(n-1) - 4*a(n-2) + 2*a(n-3).
%F A100132 a(n) = Sum_{k=0..floor(n/2)} C(n-k, k)2^(n-3k/2)(1+(-1)^k)/2. - _Paul Barry_, Jan 22 2005
%t A100132 LinearRecurrence[{4,-4,0,2},{1,2,4,8},30] (* _Harvey P. Dale_, Jun 07 2016 *)
%o A100132 (PARI) a(n) = sum(k=0, n\4, binomial(n-2*k, 2*k)*2^(n-3*k)); \\ _Michel Marcus_, Oct 09 2021
%Y A100132 Cf. A100131, A100133.
%K A100132 easy,nonn
%O A100132 0,2
%A A100132 _Paul Barry_, Nov 06 2004