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

A025087

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

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =4a(6) =7a(7) =7a(8) =11a(9) =11a(10) =18a(11) =17a(12) =28a(13) =25a(14) =41a(15) =33a(16) =54a(17) =88a(18) =142a(19) =142a(20) =230a(21) =229a(22) =371a(23) =368a(24) =596a(25) =588a(26) =952a(27) =931a(28) =1507a(29) =1452

External references