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 A088334 #20 Jan 05 2025 19:51:37
%S A088334 3,14,611,1346270,6557470319843,155576970220531065681649694,
%T A088334 87571595343018854458033386304178158174356588264390371
%N A088334 Expansion of 1/phi (phi being the golden ratio) as an infinite product: 1/phi = Product_{k=0..n} (1-1/a(k)).
%C A088334 The next term is too large to include.
%H A088334 J. Shallit, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/18-1/elementary18-1.pdf">Problem B-423</a>, The Fibonacci Quarterly 18,1 Feb.(1980)85. <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/19-1/elementary19-1.pdf">Solution</a> 19,1 Feb. (1981) 92. [_Wolfdieter Lang_, Nov 04 2010]
%F A088334 a(0) = 3, a(n+1) = (a(n)-1)*A001566(n+1)
%F A088334 a(n) = 1+ceiling(1/2*(1-1/sqrt(5))*phi^(2^(n+2))) where phi=(1+sqrt(5))/2. a(n)==2 (mod 3) for n>0. - _Benoit Cloitre_, Nov 09 2003
%F A088334 a(n) = b(n+2)+1, n>=0, with b(n):= A101342(n) = F(2^n-1). See the reciprocal of the infinite product of this entry. For a proof see the J. Shallit reference. - _Wolfdieter Lang_, Nov 04 2010
%o A088334 (PARI) a(n)=if(n<0,0,fibonacci(2^(n+2)-1)+1)
%Y A088334 Cf. A001566, A001622, A094214, A101342.
%K A088334 nonn
%O A088334 0,1
%A A088334 _Thomas Baruchel_, Nov 07 2003