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 A219160 #13 Jul 12 2018 20:28:07
%S A219160 4,52,140452,2770663499604052,
%T A219160 21269209556953516583554114034636483645584976452
%N A219160 Recurrence equation a(n+1) = a(n)^3 - 3*a(n) with a(0) = 4.
%C A219160 For some general remarks on this recurrence see A001999.
%H A219160 G. C. Greubel, <a href="/A219160/b219160.txt">Table of n, a(n) for n = 0..6</a>
%H A219160 E. B. Escott, <a href="https://www.jstor.org/stable/2301484">Rapid method for extracting a square root</a>, Amer. Math. Monthly, 44 (1937), 644-646.
%H A219160 N. J. Fine, <a href="https://www.jstor.org/stable/2321014">Infinite products for k-th roots</a>, Amer. Math. Monthly Vol. 84, No. 8, Oct. 1977.
%F A219160 a(n) = (2 + sqrt(3))^(3^n) + (2 - sqrt(3))^(3^n).
%F A219160 Product {n = 0..inf} (1 + 2/(a(n) - 1)) = sqrt(3). The rate of convergence is cubic. Fine remarks that taking the first twelve factors of the product would give well over 300,000 correct decimals for sqrt(3).
%t A219160 RecurrenceTable[{a[n] == a[n - 1]^3 - 3*a[n - 1], a[0] == 4}, a, {n,
%t A219160 0, 5}] (* _G. C. Greubel_, Dec 30 2016 *)
%Y A219160 Cf. A001999, A112845, A219161.
%K A219160 nonn,easy
%O A219160 0,1
%A A219160 _Peter Bala_, Nov 13 2012