Random Fibonacci recursion

https://en.wikipedia.org/wiki/Random_Fibonacci_sequence

In mathematics, therandom Fibonacci sequenceis a stochastic analogue of the Fibonacci sequence defined by the recurrence relation , where the signs + or − are chosen at random with equal probability , independently for different . By a theorem of Harry Kesten and Hillel Furstenberg, random recurrent sequences of this kind grow at a certain exponential rate, but it is difficult to compute the rate explicitly. In 1999, Divakar Viswanath showed that the growth rate of the random Fibonacci sequence is equal to 1.1319882487943...(sequence A078416 in the OEIS), a mathematical constant that was later named Viswanath's constant.