a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ] and s = (Fibonacci numbers).

Terms

a(0) =1a(1) =2a(2) =5a(3) =8a(4) =19a(5) =31a(6) =65a(7) =105a(8) =210a(9) =340a(10) =654a(11) =1058a(12) =1985a(13) =3212a(14) =5911a(15) =9564a(16) =17345a(17) =28065a(18) =50305a(19) =81395a(20) =144516a(21) =233832a(22) =411900a(23) =666468a(24) =1166209a(25) =1886966a(26) =3283145a(27) =5312240a(28) =9197455a(29) =14881795