1345282

Appears in sequences

• Number of ways a black pawn (from any starting square on the second back rank) can (theoretically) end on the n-th square of the leftmost file counted from the back rank.at n=15A062106
• a(n) = sum of n Fibonacci numbers starting from F(n).at n=15A096140
• Convolution of A066983 with the double Fibonacci sequence A103609.at n=30A121364
• a(n) = Sum_{k=floor((n+1)/2)..n} Fibonacci(k+1).at n=28A129361