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 = (composite numbers).

A025081

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 = (composite numbers).

Terms

    a(0) =6a(1) =8a(2) =17a(3) =19a(4) =40a(5) =46a(6) =83a(7) =95a(8) =166a(9) =185a(10) =312a(11) =337a(12) =561a(13) =608a(14) =1000a(15) =1091a(16) =1783a(17) =1914a(18) =3117a(19) =3284a(20) =5335a(21) =5630a(22) =9132a(23) =9674a(24) =15677a(25) =16343a(26) =26470a(27) =27607a(28) =44697a(29) =46688

External references