login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A084910 Fibonacci numbers that satisfy: Sum_{k>=1} 1/a(k) = tau-1, such that the partial sums are nearest to, but never exceed, tau-1 = (sqrt(5)-1)/2. 3
2, 13, 34, 89, 2584, 17711, 75025, 196418, 832040, 9227465, 433494437, 2971215073, 12586269025, 32951280099, 139583862445, 365435296162, 1548008755920, 4052739537881, 10610209857723, 27777890035288, 72723460248141 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Corresponding Fibonacci indices are given by A084909.

LINKS

Amiram Eldar, Table of n, a(n) for n = 1..1323

FORMULA

a(n) = A000045(A084909(n)+1). - Amiram Eldar, Nov 01 2019

EXAMPLE

(sqrt(5)-1)/2 = 1/F(2) + 1/F(6) + 1/F(8) + 1/F(10) + 1/F(17) + 1/F(21) + ... = 1/2 + 1/13 + 1/34 + 1/89 + 1/2584 + 1/17711 + 1/75025 +...

MATHEMATICA

seq = {}; s = GoldenRatio - 1; m = 3; Do[AppendTo[seq, Fibonacci[m]]; s -= (1/Fibonacci[m]); While[Fibonacci[m] <= 1/s, m++], {21}]; seq (* Amiram Eldar, Nov 01 2019 *)

PROG

(PARI) x=(sqrt(5)-1)/2; a=2; S=0; for(n=1, 100, b=a+1; while(abs(S+1/fibonacci(b))>x, b++); S=S+1/fibonacci(b); a=b; print1(fibonacci(b), ", "))

CROSSREFS

Cf. A000045, A001622, A084908, A084909.

Sequence in context: A062708 A296293 A190816 * A124024 A102229 A254965

Adjacent sequences:  A084907 A084908 A084909 * A084911 A084912 A084913

KEYWORD

nonn

AUTHOR

Paul D. Hanna, Jun 10 2003

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 23 16:32 EST 2021. Contains 340385 sequences. (Running on oeis4.)