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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A293641 a(n) is the integer k that minimizes |k/Fibonacci(n) - 2/5|. 3
 0, 0, 0, 1, 1, 2, 3, 5, 8, 14, 22, 36, 58, 93, 151, 244, 395, 639, 1034, 1672, 2706, 4378, 7084, 11463, 18547, 30010, 48557, 78567, 127124, 205692, 332816, 538508, 871324, 1409831, 2281155, 3690986, 5972141, 9663127, 15635268, 25298394, 40933662, 66232056 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 LINKS Clark Kimberling, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (1, 2, -1, -2, 1, 2, -1, -2, 1, 1) FORMULA G.f.: -((x^3 (1 - x^2 + x^4))/((-1 + x + x^2) (1 - x^2 + x^4 - x^6 + x^8))). a(n) = a(n-1) + 2 a(n-2) - a(n-3) - 2 a(n-4) + a(n-5) + 2 a(n-6) - a(n-7) - 2 a(n-8) + a(n-9) + a(n-10) for n >= 11. a(n) = floor(1/2 + 2*Fibonacci(n)/5). a(n) = A293639(n) if (fractional part of 2*F(n)/5) < 1/2, otherwise a(n) = A293640(n). MATHEMATICA z = 120; r = 2/5; f[n_] := Fibonacci[n]; Table[Floor[r*f[n]], {n, 0, z}];   (* A293639 *) Table[Ceiling[r*f[n]], {n, 0, z}]; (* A293640 *) Table[Round[r*f[n]], {n, 0, z}];   (* A293641 *) CROSSREFS Cf. A000045, A293639, A293640. Sequence in context: A212607 A056366 A000046 * A293553 A131132 A293545 Adjacent sequences:  A293638 A293639 A293640 * A293642 A293643 A293644 KEYWORD nonn,easy AUTHOR Clark Kimberling, Oct 14 2017 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.

Last modified September 21 11:17 EDT 2020. Contains 337268 sequences. (Running on oeis4.)