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!)
A269991 Decimal expansion of Sum_{n >= 1} 2^(1-n)/Fibonacci(n). 5
1, 6, 8, 4, 8, 1, 3, 1, 4, 4, 4, 8, 9, 5, 7, 6, 0, 9, 6, 3, 1, 6, 5, 5, 4, 3, 3, 7, 3, 8, 0, 0, 7, 8, 2, 3, 0, 2, 3, 7, 0, 6, 3, 8, 8, 2, 4, 5, 7, 0, 8, 6, 8, 2, 0, 9, 4, 3, 1, 7, 6, 1, 8, 8, 5, 9, 5, 0, 5, 6, 0, 0, 2, 8, 0, 4, 9, 4, 5, 4, 9, 8, 9, 1, 0, 8 (list; constant; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
Equals Sum_{n>=0} 1/A063727(n) = Sum_{n>=1} 1/A085449(n) = 2 * Sum_{n>=1} 1/A103435(n) = 4 * Sum_{n>=1} 1/A209084(n). - Amiram Eldar, Feb 01 2021
EXAMPLE
1.684813144489576096316554337380078230...
MATHEMATICA
x = N[Sum[2^(1 - n)/Fibonacci[n], {n, 1, 500}], 100]
RealDigits[x][[1]]
PROG
(PARI) suminf(n=1, 2^(1-n)/fibonacci(n)) \\ Michel Marcus, Feb 01 2021
CROSSREFS
Sequence in context: A247038 A195492 A269802 * A171784 A200133 A021150
KEYWORD
nonn,cons,easy
AUTHOR
Clark Kimberling, Mar 12 2016
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 10:51 EDT 2024. Contains 371967 sequences. (Running on oeis4.)