A recursive sequence: a(n) = Fibonacci(n)*a(n-1) + 3.

A238244

A recursive sequence: a(n) = Fibonacci(n)*a(n-1) + 3.

Terms

    a(0) =1a(1) =4a(2) =11a(3) =36a(4) =183a(5) =1467a(6) =19074a(7) =400557a(8) =13618941a(9) =749041758a(10) =66664716465

External references