|
|
A354210
|
|
a(n) = floor(sqrt(Fibonacci(n+1)*Fibonacci(n))).
|
|
1
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
LINKS
|
P. Ferraro, Problem B-1288, Fibonacci Q., 59 (No. 2, May 2021) p. 177.
|
|
FORMULA
|
|
|
MATHEMATICA
|
a[n_] := Floor[Sqrt[Fibonacci[n + 1] * Fibonacci[n]]]; Array[a, 42, 0] (* Amiram Eldar, May 19 2022 *)
|
|
PROG
|
(PARI) a(n) = sqrtint(fibonacci(n+1)*fibonacci(n));
(Python)
from math import prod
from gmpy2 import isqrt, fib2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|