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

A024872

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

Terms

    a(0) =2a(1) =4a(2) =12a(3) =19a(4) =43a(5) =70a(6) =138a(7) =223a(8) =409a(9) =662a(10) =1162a(11) =1880a(12) =3210a(13) =5194a(14) =8710a(15) =14093a(16) =23353a(17) =37786a(18) =62118a(19) =100509a(20) =164355a(21) =265932a(22) =433316a(23) =701120a(24) =1139714a(25) =1844096a(26) =2992960a(27) =4842711a(28) =7851463a(29) =12703934

External references