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 A108732 #20 Mar 12 2024 22:51:37
%S A108732 22,11,44,22,88,44,176,88,352,176,704,352,1408,704,2816,1408,5632,
%T A108732 2816,11264,5632,22528,11264,45056,22528,90112,45056,180224,90112,
%U A108732 360448,180224,720896,360448,1441792,720896
%N A108732 a(0)=22; if n odd, a(n) = a(n-1)/2, otherwise a(n) = 4*a(n-1).
%C A108732 A108213 is a subsequence of this sequence and is also twice this sequence.
%H A108732 Harvey P. Dale, <a href="/A108732/b108732.txt">Table of n, a(n) for n = 0..1000</a>
%H A108732 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0,2)
%F A108732 a(2n+1) = a(2n-2).
%F A108732 Recurrence: a(n) = 2a(n-2), a(0)=22, a(1)=11. G.f.: (22x+44)/(1-2x^2). - _Ralf Stephan_, Jul 16 2013
%F A108732 a(n) = 11 * 2^A028242(n). - _Franklin T. Adams-Watters_, Mar 29 2006
%t A108732 nxt[{n_,a_}]:={n+1,If[EvenQ[n],a/2,4a]}; NestList[nxt,{0,22},40][[All,2]] (* or *) LinearRecurrence[{0,2},{22,11},40] (* _Harvey P. Dale_, Jul 22 2021 *)
%Y A108732 Cf. A005015, A108213.
%K A108732 easy,nonn
%O A108732 0,1
%A A108732 _Alexandre Wajnberg_ & Guadalupe Garcia, Jun 22 2005