Number of recursive calls needed to compute the n-th Fibonacci number F(n), starting with F(1) = F(2) = 1.

A019274

Number of recursive calls needed to compute the n-th Fibonacci number F(n), starting with F(1) = F(2) = 1.

Terms

    a(0) =0a(1) =0a(2) =2a(3) =4a(4) =8a(5) =14a(6) =24a(7) =40a(8) =66a(9) =108a(10) =176a(11) =286a(12) =464a(13) =752a(14) =1218a(15) =1972a(16) =3192a(17) =5166a(18) =8360a(19) =13528a(20) =21890a(21) =35420a(22) =57312a(23) =92734a(24) =150048a(25) =242784a(26) =392834a(27) =635620a(28) =1028456a(29) =1664078

External references