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 A258169 #10 Sep 04 2022 09:56:21
%S A258169 1,2,16,32768,72057594037927936,
%T A258169 822752278660603021077484591278675252491367932816789931674304512
%N A258169 a(n) = a(n-1)^4/a(n-2) with a(0)=1, a(1)=2.
%C A258169 The next term has 235 digits.
%C A258169 In general, the recurrence a(n) = a(n-1)^k / a(n-2) with a(0) = 1, a(1) = m, k > 2, has a solution a(n) = m^(((k+sqrt(k^2-4))^n - (k-sqrt(k^2-4))^n) / (sqrt(k^2-4) * 2^n)).
%F A258169 a(n) = 2^(A001353(n)).
%F A258169 a(n) = 2^(((2+sqrt(3))^n-(2-sqrt(3))^n)/(2*sqrt(3))).
%t A258169 RecurrenceTable[{a[n]==a[n-1]^4/a[n-2], a[0]==1, a[1]==2},a,{n,0,6}]
%t A258169 nxt[{a_,b_}]:={b,b^4/a}; NestList[nxt,{1,2},5][[All,1]] (* _Harvey P. Dale_, Sep 04 2022 *)
%Y A258169 Cf. A001353, A112969, A208208, A258161.
%K A258169 nonn,easy
%O A258169 0,2
%A A258169 _Vaclav Kotesovec_, May 22 2015