-1346269

Appears in sequences

• a(n) = (-1)^n * Fibonacci(2*n+1).at n=15A099496
• a(n) = a(n-1)+a(n-2), n>1 ; a(0)=1, a(1)=-1.at n=33A152163
• a(n)=(-1)^C(n+1,2)*(F(n+1)*(1+(-1)^n)/2+F(n+2)*(1-(-1)^n)/2).at n=29A178115
• a(n)=(-1)^C(n+1,2)*(F(n+1)*(1+(-1)^n)/2+F(n+2)*(1-(-1)^n)/2).at n=30A178115
• a(n) = F(n) * (-1)^(n*(n-1)/2) where F(n) = A000045(n) Fibonacci numbers.at n=31A333378
• Dirichlet inverse of Fibonacci numbers, when started from A000045(1): 1, 1, 2, 3, 5, 8, 13, 21, ...at n=30A349451