1089154

Appears in sequences

• a(n) = floor(Fibonacci(n)/2).at n=32A004695
• a(n) = C(n-1,1) + C(n-3,3) + ... + C(n-2*m-1,2*m+1), where m = floor((n-2)/4).at n=29A024490
• Indices of triangular numbers which are also heptagonal.at n=5A039835
• A Fibonacci convolution.at n=31A094686
• A transform of (1-x)/(1-2x).at n=29A099517
• a(n) = F(3) + F(6) + F(9) + ... + F(3n), F(n) = Fibonacci numbers A000045.at n=10A099919
• Number of different possible rows (or columns) in an n X n crossword puzzle.at n=29A130578
• a(n) = (A000045(n)-A173432(n))/2.at n=31A173434
• Partial sums of odd Fibonacci numbers (A014437).at n=19A174542
• a(n) = ((F(n-1)+F(n-2))-1)/2 if F(n) is odd, otherwise a(n) = ((F(n-1)+F(n-2))-2)/2, where F(n) = A000045(n) is the n-th Fibonacci number.at n=31A201864
• a(n) is the integer k that minimizes |k/Fibonacci(n) - 1/2|.at n=32A293505
• Lower (1/2)-midsequence of (F(2n)) and (F(2n+1)), where F=A000045 (Fibonacci numbers); see Comments.at n=15A387778