119814916

Appears in sequences

• a(n) = a(n-1) + a(n-3) + a(n-4), a(0) = a(1) = a(2) = 1, a(3) = 2.at n=40A006498
• Squared Fibonacci numbers: a(n) = F(n)^2 where F = A000045.at n=21A007598
• Squares of even Fibonacci numbers.at n=7A014729
• Lesser of twin numbers (differing by 1) of the form F(i)^2 + F(j)^3 (A045704), where F() are Fibonacci numbers.at n=33A063907
• a(n)-1, a(n) and a(n)+1 form three consecutive integers that can be factored into Fibonacci numbers.at n=22A065885
• a(n) = (Lucas(4*n+2) + 2)/5, or Fibonacci(2*n+1)^2, or A081067(n)/5.at n=10A081068
• a(n)= 3*a(n-1) -3*a(n-3) +a(n-4), n>6.at n=22A107840
• A product of consecutive doubled Fibonacci numbers.at n=21A166516
• a(n) = F(n+1)^2, if n>=0 is even (F=A000045) and a(n) = (L(2n+2)+8)/5, if n is odd (L=A000204).at n=20A208176
• Number of nX4 0..1 arrays with every element equal to 0, 1 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=18A301960
• a(n) = A007598(floor(n/2) - (-1)^n).at n=41A380696