cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A293419 a(n) is the least integer k such that k/Fibonacci(n) > sqrt(2).

Original entry on oeis.org

0, 2, 2, 3, 5, 8, 12, 19, 30, 49, 78, 126, 204, 330, 534, 863, 1396, 2259, 3655, 5913, 9568, 15480, 25048, 40528, 65575, 106102, 171676, 277777, 449453, 727230, 1176683, 1903912, 3080595, 4984507, 8065101, 13049607, 21114707, 34164313, 55279019, 89443332
Offset: 0

Views

Author

Clark Kimberling, Oct 12 2017

Keywords

Crossrefs

Programs

  • Magma
    [Ceiling(Fibonacci(n)*Sqrt(2)): n in [0..30]]; // G. C. Greubel, Feb 08 2018
  • Mathematica
    z = 120; r = Sqrt[2]; f[n_] := Fibonacci[n];
    Table[Floor[r*f[n]], {n, 0, z}];   (* A293418 *)
    Table[Ceiling[r*f[n]], {n, 0, z}]; (* A293419 *)
    Table[Round[r*f[n]], {n, 0, z}];   (* A293420 *)
  • PARI
    for(n=0, 30, print1(ceil(fibonacci(n)*sqrt(2)), ", ")) \\ G. C. Greubel, Feb 08 2018
    

Formula

a(n) = ceiling(Fibonacci(n)*sqrt(2)).
a(n) = A293418(n) + 1 for n > 0.

A293418 a(n) is the greatest integer k such that k/Fibonacci(n) < sqrt(2).

Original entry on oeis.org

0, 1, 1, 2, 4, 7, 11, 18, 29, 48, 77, 125, 203, 329, 533, 862, 1395, 2258, 3654, 5912, 9567, 15479, 25047, 40527, 65574, 106101, 171675, 277776, 449452, 727229, 1176682, 1903911, 3080594, 4984506, 8065100, 13049606, 21114706, 34164312, 55279018, 89443331
Offset: 0

Views

Author

Clark Kimberling, Oct 12 2017

Keywords

Crossrefs

Programs

  • Magma
    [Floor(Fibonacci(n)*Sqrt(2)): n in [0..30]]; // G. C. Greubel, Feb 08 2018
  • Mathematica
    z = 120; r = Sqrt[2]; f[n_] := Fibonacci[n];
    Table[Floor[r*f[n]], {n, 0, z}];   (* A293418 *)
    Table[Ceiling[r*f[n]], {n, 0, z}]; (* A293419 *)
    Table[Round[r*f[n]], {n, 0, z}];   (* A293420 *)
  • PARI
    for(n=0,30, print1(floor(fibonacci(n)*sqrt(2)), ", ")) \\ G. C. Greubel, Feb 08 2018
    

Formula

a(n) = floor(Fibonacci(n)*sqrt(2)).
a(n) = A293419(n) - 1 for n > 0.
Showing 1-2 of 2 results.