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 A010099 #34 Jan 05 2025 19:51:34 %S A010099 1,4,4,16,64,1024,65536,67108864,4398046511104,295147905179352825856, %T A010099 1298074214633706907132624082305024, %U A010099 383123885216472214589586756787577295904684780545900544 %N A010099 a(n) = a(n-1)*a(n-2) with a(0)=1, a(1)=4. %C A010099 From _Peter Bala_, Nov 01 2013: (Start) %C A010099 Let phi = 1/2*(1 + sqrt(5)) denote the golden ratio A001622. This sequence is the simple continued fraction expansion of the constant c := 3*sum {n = 1..inf} 1/4^floor(n*phi) (= 9*sum {n = 1..inf} floor(n/phi)/4^n) = 0.80938 42984 64421 90504 ... = 1/(1 + 1/(4 + 1/(4 + 1/(16 + 1/(64 + 1/(1024 + 1/(65536 + ...))))))). The constant c is known to be transcendental (see Adams and Davison 1977). Cf. A014565. %C A010099 Furthermore, for k = 0,1,2,... if we define the real number X(k) = sum {n >= 1} 1/4^(n*Fibonacci(k) + Fibonacci(k+1)*floor(n*phi)) then the real number X(k+1)/X(k) has the simple continued fraction expansion [0; a(k+1), a(k+2), a(k+3), ...] (apply Bowman 1988, Corollary 1). (End) %H A010099 Indranil Ghosh, <a href="/A010099/b010099.txt">Table of n, a(n) for n = 0..17</a> %H A010099 W. W. Adams and J. L. Davison, <a href="http://www.jstor.org/stable/2041889">A remarkable class of continued fractions</a>, Proc. Amer. Math. Soc. 65 (1977), 194-198. %H A010099 P. G. Anderson, T. C. Brown, P. J.-S. Shiue, <a href="http://people.math.sfu.ca/~vjungic/tbrown/tom-28.pdf">A simple proof of a remarkable continued fraction identity</a>, Proc. Amer. Math. Soc. 123 (1995), 2005-2009. %H A010099 D. Bowman, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/26-1.html">A new generalization of Davison's theorem</a>, Fib. Quart. Volume 26 (1988), 40-45 %F A010099 a(n) = 4^Fibonacci(n). %p A010099 a[ -1]:=1:a[0]:=4: a[1]:=4: for n from 2 to 13 do a[n]:=a[n-1]*a[n-2] od: seq(a[n], n=-1..10); # _Zerinvary Lajos_, Mar 19 2009 %Y A010099 Cf. A000045, A000301, A010098, A010100, A014565, A214706, A214887, A215270, A215271, A215272. %Y A010099 Column k=4 of A244003. %K A010099 nonn,easy %O A010099 0,2 %A A010099 _N. J. A. Sloane_