92734

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=23A019274
• Partial sums of repeated Fibonacci sequence.at n=45A094707
• Length of the n-th term in the modified Look and Say sequence A110393.at n=43A179999
• Number of nX6 0..3 arrays with antidiagonals unimodal and rows and diagonals nondecreasing.at n=2A223959
• T(n,k)=Number of nXk 0..3 arrays with antidiagonals unimodal and rows and diagonals nondecreasing.at n=30A223961
• Number of 3 X n 0..3 arrays with antidiagonals unimodal and rows and diagonals nondecreasing.at n=5A223963
• a(0)=1, a(1)=-2; a(n+2) = a(n+1) + a(n) + (period 3: repeat 3, 1, -1).at n=25A226328
• Partial sums of L(1) - F(1) + L(2) - F(2) + L(3) - F(3) + ..., where L = A000032 and F = A000045.at n=45A355019