158906

Appears in sequences

• 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=25A024490
• A Fibonacci convolution.at n=27A094686
• a(n) = floor[(phi + n mod 2)*a(n-1)], a(1)=1.at n=18A107857
• a(n) = b(k), where b(k) = Fibonacci(n-1) and k = floor( n*(1+sqrt(5))/2 ).at n=18A107858
• Number of nonnegative even integers <= Fibonacci(n).at n=28A147997
• a(n) = ceiling(Fibonacci(n)/2).at n=28A173173
• a(n) = (A000045(n)+A173432(n))/2.at n=27A173433
• a(2k) = floor(F(k)/2), a(2k+1) = ceiling(F(k)/2), where F = A000045 is the Fibonacci sequence.at n=57A173673
• a(n) = A174618(n) + A174618(n+1).at n=51A174619
• Expansion of (1-3*x)/(1-5*x+3*x^2+x^3).at n=9A232970
• Indices of centered pentagonal numbers (A005891) that are also triangular numbers (A000217).at n=9A254627
• a(n) = a(n-1) + a(n-2) - a(n-3) + a(n-4) for n > 4, where a(n)=0 for n < 4 and a(4) = 1.at n=30A293014
• a(n) is the integer k that minimizes |k/Fibonacci(n) - 1/2|.at n=28A293505
• Expansion of 1/( (1 + x) * (1 - x^2*(1 + x)^2) ).at n=28A375372
• Upper (1/2)-midsequence of (F(2n)) and (F(2n+1)), where F=A000045 (Fibonacci numbers); see Comments.at n=13A387779