1346267

Appears in sequences

• a(n) = Fibonacci(n+3) - 2.at n=28A001911
• Number of strict (-1)st-order maximal independent sets in path graph.at n=28A007382
• Expansion of (1-x)/(1-2*x^2-x^3).at n=33A078024
• a(n) = Fibonacci(4*n+3) - 2, or Fibonacci(2*n)*Lucas(2*n+3).at n=7A081013
• Number of compositions of n into parts 1 and 2 with both parts present.at n=27A245738
• a(n) = (Fibonacci(n+2)-1) mod Fibonacci(floor(n/2)).at n=60A270741
• a(n) = a(n-1) + a(n-2) - a(n-3) + a(n-4) + a(n-5), with a(0)=a(1)=a(2)=1, a(3)=-1 and a(4)=1.at n=33A290968