I'm looking for the asymptotic approximation of the product of the first $n$ Fibonacci numbers.
Does there exist a tight approximation for these kind of things?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.Sign up to join this community
By the Binet formula,
Then multiplying the $n$ first estimates
By numerical computation, $a\approx 1.22674201072$.
We can deduce an expression for the geometric average