1028456

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=28A019274
• a(n) = 2*Fibonacci(n+2) + ((-1)^n - 3)/2.at n=27A066629
• Starting at the chess position shown, a(n) is the number of ways Black can make n consecutive moves, followed by a checkmate in one move by White.at n=31A078993
• Diagonal sums of number triangle A132046.at n=28A154327