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-1 of 1 results.

A354210 a(n) = floor(sqrt(Fibonacci(n+1)*Fibonacci(n))).

Original entry on oeis.org

0, 1, 1, 2, 3, 6, 10, 16, 26, 43, 69, 113, 183, 296, 479, 775, 1255, 2031, 3286, 5318, 8605, 13923, 22528, 36452, 58981, 95433, 154414, 249847, 404261, 654109, 1058371, 1712480, 2770851, 4483332, 7254184, 11737516, 18991701, 30729217, 49720919, 80450136, 130171055, 210621192
Offset: 0

Views

Author

Michel Marcus, May 19 2022

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := Floor[Sqrt[Fibonacci[n + 1] * Fibonacci[n]]]; Array[a, 42, 0] (* Amiram Eldar, May 19 2022 *)
  • PARI
    a(n) = sqrtint(fibonacci(n+1)*fibonacci(n));
    
  • Python
    from math import prod
    from gmpy2 import isqrt, fib2
    def A354210(n): return int(isqrt(prod(fib2(n+1)))) # Chai Wah Wu, May 19 2022

Formula

a(n) = floor(sqrt(A001654(n))).
Showing 1-1 of 1 results.