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 A115034 #8 Jun 18 2021 07:23:06
%S A115034 1,2,2,1,2,2,4,2,8,4,32,8,256,32,8192,256,2097152,8192,17179869184,
%T A115034 2097152,36028797018963968,17179869184,618970019642690137449562112,
%U A115034 36028797018963968
%N A115034 Alternately multiply and divide, with a(1)=1 and a(2)=2.
%C A115034 a(n) = power of 2; taking the terms a(n+1)>=a(n), the sequence of exponent of power of 2 is 0,1,1,2,3,5,8,... which are the Fibonacci Numbers.
%F A115034 a(2*k) = a(2*k-3); a(2*k+1) = a(2*k)*a(2*k-1) - _Georg Fischer_, Jun 18 2021
%t A115034 nxt[{a_, b_}]:={a*b, (a*b)/b}; NestList[nxt, {1,2}, 10]//Flatten (* _Georg Fischer_, Jun 18 2021 *)
%Y A115034 Cf. A115033, A174348.
%K A115034 easy,nonn
%O A115034 1,2
%A A115034 _Giovanni Teofilatto_, Feb 26 2006; corrected Feb 28 2006
%E A115034 Definition adapted to offset by _Georg Fischer_, Jun 18 2021