login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A226126
Denominators of signed Egyptian fractions 1/(2+a(n)) with sums converging to sqrt(2).
1
8, 65, 5856, 39703530, 1895307350287177, 46342142299686404785297514402543, 186913643198872746939347285190966650469716954961536584709363654945
OFFSET
1,1
COMMENTS
The algorithm at A226049, with r = sqrt(2) and f(n) = 1/(n+2), gives a sum that converges to sqrt(2). The 16th partial sum differs from sqrt(2) by less than 10^(-500).
EXAMPLE
Sum of the first 12 signed Egyptian fractions: 1/3 + 1/4 + 1/5 + 1/6 + 1/7 + 1/8 + 1/9 + 1/10 - 1/67 + 1/5858 - 1/39703532 showing denominators (beginning at 10), a(1)+1, a(2)+1, a(3)+1, ...
MATHEMATICA
$MaxExtraPrecision = Infinity;
z = 9; f[n_] := 1/(n + 2); g[n_] := 1/n - 2; r = Sqrt[2]; s = 0; a[1] = NestWhile[# + 1 &, 1, ! (s += f[#]) > r &]; p = Sum[f[n], {n, 1, a[1]}]; a[2] = Floor[g[p - r]]; a[n_] := Floor[g[((-1)^n) (p - r - Sum[((-1)^k) f[a[k]], {k, 2, n - 1}])]]; Table[a[k], {k, 1, z}]
N[p - Sum[((-1)^n)*f[a[n]], {n, 2, z}] - r, 20]
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, May 27 2013
STATUS
approved