150048

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=24A019274
• a(n) = 2*Fibonacci(n+2) + ((-1)^n - 3)/2.at n=23A066629
• 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=27A078993
• Partial sums of repeated Fibonacci sequence.at n=47A094707
• Left border of triangle A137629.at n=43A137631
• Diagonal sums of number triangle A132046.at n=24A154327
• Length of the n-th term in the modified Look and Say sequence A110393.at n=45A179999
• Numbers k that divide the base-5 reversal of k.at n=24A222816
• 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=24A253197
• Numbers n such that n+k-1 is the sum of two nonzero squares in exactly k ways for all k = 1, 2, 3.at n=3A273318
• The number of positive integer sequences of length n with no duplicate substrings (forward or backward) of length greater than 1, every number different from its neighbors, and a minimal sum (= A282167(n)).at n=15A284433
• Partial sums of L(1) - F(1) + L(2) - F(2) + L(3) - F(3) + ..., where L = A000032 and F = A000045.at n=47A355019