a(0)=1, a(1)=0; thereafter a(n) = 2^Fibonacci(n-1)*a(n-1) + a(n-2).
A288581
a(0)=1, a(1)=0; thereafter a(n) = 2^Fibonacci(n-1)*a(n-1) + a(n-2).
Terms
- a(0) =1a(1) =0a(2) =1a(3) =2a(4) =9a(5) =74a(6) =2377a(7) =608586a(8) =4985538889
External references
- oeis: A288581