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

A024461

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

Terms

    a(0) =4a(1) =6a(2) =14a(3) =17a(4) =35a(5) =40a(6) =73a(7) =83a(8) =145a(9) =166a(10) =281a(11) =312a(12) =519a(13) =561a(14) =923a(15) =1000a(16) =1635a(17) =1783a(18) =2904a(19) =3117a(20) =5064a(21) =5335a(22) =8654a(23) =9132a(24) =14800a(25) =15677a(26) =25391a(27) =26470a(28) =42857a(29) =44697

External references