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 A084594 #21 Feb 16 2025 08:32:49
%S A084594 1,4,28,1552,4817152,46409906716672,4307758882900393634270543872,
%T A084594 37113573186414494550922197215584520229965687291643953152
%N A084594 a(n) = Sum_{r=0..2^(n-1)} Binomial(2^n,2r)*3^r.
%C A084594 a(n)/A084595(n) converges to sqrt(3). Related to Newton's iteration.
%H A084594 A. V. Aho and N. J. A. Sloane, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/11-4/aho-a.pdf">Some doubly exponential sequences</a>, Fibonacci Quarterly, Vol. 11, No. 4 (1973), pp. 429-437.
%H A084594 A. V. Aho and N. J. A. Sloane, <a href="/A000058/a000058.pdf">Some doubly exponential sequences</a>, Fibonacci Quarterly, Vol. 11, No. 4 (1973), pp. 429-437 (original plus references that F.Q. forgot to include - see last page!)
%H A084594 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/NewtonsIteration.html">Newton's Iteration</a>.
%F A084594 a(n) = ( (1+sqrt(3))^(2^n) + (1-sqrt(3))^(2^n) )/2.
%F A084594 a(n) = A026150(2^n).
%F A084594 a(n) = 2*a(n-1)^2 - A001146(n-1), n>1.
%F A084594 a(n) = a(n-1)^2 + 3*A084595(n-1)^2.
%t A084594 Table[Sum[Binomial[2^n, 2 r]3^r, {r, 0, 2^(n - 1)}], {n, 0, 8}]
%t A084594 Table[Simplify[Expand[(1/2) ((1 + Sqrt[3])^(2^n) + (1 - Sqrt[3])^(2^n))]], {n, 0, 7}] (* _Artur Jasinski_, Oct 11 2008 *)
%Y A084594 Cf. A001146, A026150, A084595,
%K A084594 easy,nonn
%O A084594 0,2
%A A084594 Mario Catalani (mario.catalani(AT)unito.it), May 31 2003