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

A024467

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

Terms

    a(0) =0a(1) =1a(2) =2a(3) =1a(4) =3a(5) =2a(6) =4a(7) =7a(8) =12a(9) =11a(10) =19a(11) =18a(12) =30a(13) =28a(14) =46a(15) =41a(16) =67a(17) =54a(18) =88a(19) =142a(20) =231a(21) =230a(22) =373a(23) =371a(24) =601a(25) =596a(26) =965a(27) =952a(28) =1541a(29) =1507

External references