Skip to content

A019274

OEIS Lean4

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

offset: 1
codomain: ℕ