19544084

Appears in sequences

• a(n) = floor(Fibonacci(n)/2).at n=38A004695
• 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=35A024490
• A Fibonacci convolution.at n=37A094686
• A transform of (1-x)/(1-2x).at n=35A099517
• a(n) = F(3) + F(6) + F(9) + ... + F(3n), F(n) = Fibonacci numbers A000045.at n=12A099919
• Expansion of -x/((x^2+x+1)*(x^2+3*x+1)); invert transform gives signed version of tetrahedral numbers A000292.at n=18A113067
• Number of different possible rows (or columns) in an n X n crossword puzzle.at n=35A130578
• Partial sums of odd Fibonacci numbers (A014437).at n=23A174542
• 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=37A201864
• p-INVERT of the positive integers, where p(S) = 1 - S^2.at n=18A290890
• a(n) is the integer k that minimizes |k/Fibonacci(n) - 1/2|.at n=38A293505
• Lower (1/2)-midsequence of (F(2n)) and (F(2n+1)), where F=A000045 (Fibonacci numbers); see Comments.at n=18A387778