2692536

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=30A019274
• Sum{T(i,n-i): i=0,1,...,n}, array T given by A047000.at n=23A047001
• a(n) = 2*Fibonacci(n+2) + ((-1)^n - 3)/2.at n=29A066629
• 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=33A078993
• Diagonal sums of number triangle A132046.at n=30A154327
• 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=30A253197