We prove that the average value of the n-th term of a sequence defined by the recurrence relation g n = |g n−1 ± g n−2 |, where the ± sign is randomly chosen, increases exponentially, with a growth rate given by an explicit algebraic number of degree 3. The proof involves a binary tree such that the number of nodes in each row is a Fibonacci number.