a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = (F(2), F(3), F(4), ...).

A025082

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = (F(2), F(3), F(4), ...).

Terms

    a(0) =2a(1) =3a(2) =8a(3) =13a(4) =31a(5) =50a(6) =105a(7) =170a(8) =340a(9) =550a(10) =1058a(11) =1712a(12) =3212a(13) =5197a(14) =9564a(15) =15475a(16) =28065a(17) =45410a(18) =81395a(19) =131700a(20) =233832a(21) =378348a(22) =666468a(23) =1078368a(24) =1886966a(25) =3053175a(26) =5312240a(27) =8595385

External references