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 A270394 #16 Feb 16 2025 08:33:31 %S A270394 2,3,9,59,9437,62059971,2813586350787717, %T A270394 8534689167911295735140758101600, %U A270394 54171527001975050997893888972139886506909953999125751170768531 %N A270394 Denominators of r-Egyptian fraction expansion for sqrt(1/2), where r(k) = 1/Fibonacci(k+1). %C A270394 Suppose that r is a sequence of rational numbers r(k) <= 1 for k >= 1, and that x is an irrational number in (0,1). Let f(0) = x, n(k) = floor(r(k)/f(k-1)), and f(k) = f(k-1) - r(k)/n(k). Then x = r(1)/n(1) + r(2)/n(2) + r(3)/n(3) + ..., the r-Egyptian fraction for x. %C A270394 See A269993 for a guide to related sequences. %H A270394 Clark Kimberling, <a href="/A270394/b270394.txt">Table of n, a(n) for n = 1..12</a> %H A270394 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/EgyptianFraction.html">Egyptian Fraction</a> %H A270394 <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a> %e A270394 sqrt(1/2) = 1/2 + 1/(2*3) + 1/(3*9) + 1/(5*59) + ... %t A270394 r[k_] := 1/Fibonacci[k+1]; f[x_, 0] = x; z = 10; %t A270394 n[x_, k_] := n[x, k] = Ceiling[r[k]/f[x, k - 1]] %t A270394 f[x_, k_] := f[x, k] = f[x, k - 1] - r[k]/n[x, k] %t A270394 x = Sqrt[1/2]; Table[n[x, k], {k, 1, z}] %o A270394 (PARI) r(k) = 1/fibonacci(k+1); %o A270394 f(k,x) = if (k==0, x, f(k-1, x) - r(k)/a(k, x);); %o A270394 a(k, x=sqrt(1/2)) = ceil(r(k)/f(k-1, x)); \\ _Michel Marcus_, Mar 22 2016 %Y A270394 Cf. A269993, A000045, A010503. %K A270394 nonn,frac,easy %O A270394 1,1 %A A270394 _Clark Kimberling_, Mar 22 2016