158905

Appears in sequences

• a(n) = floor(Fibonacci(n)/2).at n=28A004695
• a(n) = Sum_{k=0..floor(n/4)} binomial(n-2k,2k).at n=27A005252
• Indices of triangular numbers which are also heptagonal.at n=4A039835
• a(n) = (F(3*n+1) - 1)/2, where F=A000045 (the Fibonacci sequence).at n=9A049651
• Expansion of (1+x)/((1+x+x^2)(1-x-x^2)).at n=26A093040
• A transform of (1-x)/(1-2x).at n=25A099517
• a(n) = (A000045(n)-A173432(n))/2.at n=27A173434
• a(2k) = floor(F(k)/2), a(2k+1) = ceiling(F(k)/2), where F = A000045 is the Fibonacci sequence.at n=56A173673
• 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=27A201864
• p-INVERT of the positive integers, where p(S) = 1 - S^2.at n=13A290890
• a(n) = 3*a(n-1) + 5*a(n-2) + a(n-3), with a(0) = a(1) = 1 and a(2) = 7, a linear recurrence which is a trisection of A005252.at n=9A294262
• Expansion of (1 - x + x^2)/((1 - x + x^2)^2 - 4*x^2).at n=13A376716
• Lower (1/2)-midsequence of (F(2n)) and (F(2n+1)), where F=A000045 (Fibonacci numbers); see Comments.at n=13A387778