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

A238243

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

Terms

    a(0) =1a(1) =3a(2) =8a(3) =26a(4) =132a(5) =1058a(6) =13756a(7) =288878a(8) =9821854a(9) =540201972a(10) =48077975510

External references