login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A338303 Decimal expansion of Sum_{k>=0} 1/(L(2*k) + 2), where L(k) is the k-th Lucas number (A000032). 1

%I #5 Oct 21 2020 20:27:01

%S 6,4,4,5,2,1,7,8,3,0,6,7,2,7,4,4,4,2,0,9,9,2,7,3,1,1,9,0,3,8,0,1,6,9,

%T 0,2,9,2,8,9,0,8,1,2,3,8,7,7,9,9,1,8,5,7,6,5,1,4,2,5,5,2,7,5,7,7,6,8,

%U 6,8,6,1,6,8,3,6,7,8,7,4,3,3,4,1,4,0,8

%N Decimal expansion of Sum_{k>=0} 1/(L(2*k) + 2), where L(k) is the k-th Lucas number (A000032).

%C Backstrom (1981) found that the sum is approximately equal to 1/8 + 1/(4*log(phi)), where phi is the golden ratio (A001622). The difference is less than 1/10^7. He called this difference "a tantalizing problem".

%C Almkvist (1986) added a term to Backstrom's formula to get an even better approximation which differs from the exact value by less than 1/10^33: 1/8 + 1/(4*log(phi)) + Pi^2/(log(phi)^2 * (exp(Pi^2/log(phi)) - 2)). He found an exact formula from a quotient of two Jacobi theta functions (see the FORMULA section), and showed that both approximations are just the first terms in a rapidly converging series.

%C Since exp(-Pi^2/log(phi)) = 1.23...*10^(-9) is small, the convergence is rapid: the number of terms needed in each of the two series in the formula to get 10^2, 10^3 and 10^4 decimal digits are merely 3, 10 and 32, respectively.

%C Andre-Jeannin (1991) noted that if the summand 2 that is added to the Lucas numbers is replaced with sqrt(5), then the sum is Sum_{k>=0} 1/(L(2*k) + sqrt(5)) = 1/phi (A094214).

%D Jonathan M. Borwein and Peter B. Borwein, Pi and the AGM, Wiley, 1987, p. 99.

%H Gert Almkvist, <a href="https://www.fq.math.ca/Scanned/24-4/almkvist.pdf">A solution to a tantalizing problem</a>, The Fibonacci Quarterly, Vol. 24, No. 4 (1986), pp. 316-322.

%H Richard Andre-Jeannin, <a href="https://www.fq.math.ca/Scanned/29-3/andre-jeannin1.pdf">Summation of certain reciprocal series related to Fibonacci and Lucas numbers</a>, The Fibonacci Quarterly, Vol. 29, No. 3 (1991), pp. 200-204.

%H Robert P. Backstrom, <a href="https://www.fq.math.ca/Scanned/19-1/backstrom.pdf">On reciprocal series related to Fibonacci numbers with subscripts in arithmetic progression</a>, The Fibonacci Quarterly, Vol. 19, No. 1 (1981), pp. 14-21. See section 6, pp. 19-20.

%H Daniel Duverney and Iekata Shiokawa, <a href="https://doi.org/10.1063/1.2841912">On series involving Fibonacci and Lucas numbers I</a>, AIP Conference Proceedings, Vol. 976, No. 1 (2008), pp. 62-76, <a href="https://danielduverney.fr/documents/theorie-des-nombres/FibonacciSeries.pdf">alternative link</a>.

%F Equals Sum_{k>=0} 1/A240926(k).

%F Equals 1/4 + Sum_{k>=1} q^(2*k)/(1 + q^(2*k))^2, where q = 1/phi.

%F Equals 1/8 + (1/(4*log(phi))) * (1 - (4*Pi^2/log(phi)) * (S(2)/(1 + 2*S(0)))), where S(m) = Sum_{k>=1} (-1)^k * k^m * exp(-Pi^2*k^2/log(phi)) (Almkvist, 1986).

%e 0.64452178306727444209927311903801690292890812387799...

%t With[{lg = Log[GoldenRatio], kmax = 3}, sum[m_, k_] := (-1)^k*k^m*Exp[-Pi^2*k^2/lg]; RealDigits[1/8 + ( 1/(4*lg))*(1 - (4*Pi^2/lg)*(Sum[sum[2, k], {k, 1, kmax}]/(1 + 2*Sum[sum[0, k], {k, 1, kmax}]))), 10, 100][[1]]]

%Y Cf. A000032, A001622, A002390, A094214, A160509, A240926.

%K nonn,cons

%O 0,1

%A _Amiram Eldar_, Oct 21 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 16:52 EDT 2024. Contains 371794 sequences. (Running on oeis4.)