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 = (1, p(1), p(2), ...).

A024460

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 = (1, p(1), p(2), ...).

Terms

    a(0) =1a(1) =2a(2) =5a(3) =8a(4) =18a(5) =28a(6) =53a(7) =73a(8) =130a(9) =170a(10) =294a(11) =352a(12) =595a(13) =715a(14) =1184a(15) =1368a(16) =2248a(17) =2630a(18) =4293a(19) =4943a(20) =8042a(21) =8882a(22) =14422a(23) =16164a(24) =26211a(25) =28523a(26) =46214a(27) =49830a(28) =80694a(29) =88192

External references