That is almost closer to the figure I have but with a different quantity on the numerator. Can you forward your complete arguments you have made please.
The sum can be computed for any number s > 0 where the question is put when s is 1/2, from a transform definition. The story of it is very important as the discrete Laplace like transform is used to generate beautiful sequences of difference equations including the Fibonacci sequence.
I'm agreeing numerically with Homeier except for the quibble that I got 1 more figure so mine ends in ..797. This was just a straight sum of 78 terms in Fortran.
Indeed the terms of the series collapse exponentially fast due to the exponential factor on the terms, the very reason the almost similarity of the sums for different terms of the series. One thing though, is FORTRAN still in use for computations ? I know when it was FORTRAN 77 version.
Well, there's a slight difference in results, depending whether one calculates the algebraically derived sum or whether one lazily lets a program do the sum.
My variables are dimensioned as 10-byte floating point, which should be better than double precision.
When I let the program compute the sum, after 75 summation steps, the answer converges to:
0.9436185014209203
On the other had, if I calculate the actual precise answer provided by George, I get:
0.943618520392048
There seems to be some accumulation of errors in the former, I have to conclude.