87801

Appears in sequences

• a(1) = 1, a(2) = 0; for n > 2, a(n) = n*Fibonacci(n-2) (with the convention Fibonacci(0)=0, Fibonacci(1)=1).at n=20A006490
• Fibonacci sequence beginning 0, 21.at n=19A022355
• G.f. = b(2)*b(4)*b(6)/(x^8+x^6-x^5+x^4-2*x^3-x+1), where b(k) = (1-x^k)/(1-x).at n=21A266340
• a(n) = n*Fibonacci(n-2) + ((-1)^n + 1)/2.at n=21A323812