635620

Appears in sequences

• Number of recursive calls needed to compute the n-th Fibonacci number F(n), starting with F(1) = F(2) = 1.at n=27A019274
• a(n) = a(n-1) + a(n-2) + (1 - (-1)^(a(n-1) + a(n-2))) with a(0) = 0, a(1) = 1.at n=27A253197