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

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A201615 Decimal expansion of Sum_{n>=1} 1/F(n)^n, where F=A000045 (Fibonacci numbers). 2
 2, 1, 3, 7, 6, 6, 9, 5, 0, 9, 6, 7, 2, 6, 9, 8, 4, 3, 3, 3, 1, 7, 1, 4, 9, 8, 1, 6, 9, 0, 3, 2, 6, 1, 9, 4, 1, 9, 0, 3, 9, 6, 6, 6, 3, 1, 7, 4, 4, 2, 0, 9, 7, 5, 8, 4, 7, 2, 1, 2, 1, 4, 7, 1, 0, 5, 2, 3, 8, 7, 1, 0, 1, 1, 6, 3, 4, 5, 5, 0, 5, 2, 5, 3, 9, 6, 5, 8, 8, 6, 2, 6, 3, 0, 5, 3, 3, 3, 6, 6, 0, 8, 6, 8, 0 (list; constant; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Table of n, a(n) for n=1..105. EXAMPLE 2.13766950967269843331714981... = 1/1^1 + 1/1^2+ 1/2^3+ 1/3^4 +1/5^5 +1/8^6 +... MAPLE with(combinat, fibonacci):Digits:=120:s:=sum( evalf(1/ fibonacci(n)^n), n=1..200):print(s): MATHEMATICA digits = 105; NSum[1/Fibonacci[n]^n, {n, 1, Infinity}, NSumTerms -> digits, WorkingPrecision -> digits] // RealDigits[#, 10, digits]& // First (* Jean-François Alcover, Feb 21 2014 *) PROG (PARI) suminf(n=1, 1/fibonacci(n)^n); \\ Michel Marcus, Feb 21 2014 CROSSREFS Cf. A079586, A158933, A000045. Sequence in context: A323943 A286616 A019320 * A033640 A112027 A174400 Adjacent sequences: A201612 A201613 A201614 * A201616 A201617 A201618 KEYWORD nonn,cons AUTHOR Michel Lagneau, Dec 03 2011 STATUS approved

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.

Last modified December 2 23:17 EST 2023. Contains 367526 sequences. (Running on oeis4.)