1836311904
domain: N
Appears in sequences
- a(n+1) = a(n) - F(n) if > 0, otherwise a(n) + F(n), where F() are Fibonacci numbers; a(0) = 0.at n=46A011369
- Expansion of (2-6*x+4*x^2-x^3)/((1-x)*(1-3*x+x^2)).at n=23A052925
- a(n) = 3*a(n-1) - a(n-2) - 1 with a(0) = 1 and a(1) = 2.at n=23A055588
- a(n) = Fibonacci(4n+2) + 1, or Fibonacci(2n+2)*Lucas(2n).at n=11A081004
- a(n) = F(n)*L(n-2) where F = Fibonacci and L = Lucas numbers.at n=24A128535
- Number of 5 X n 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,0) or (-1,-1) and new values introduced in order 0..2.at n=13A275505