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

A024315

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

Terms

    a(0) =3a(1) =6a(2) =17a(3) =27a(4) =59a(5) =96a(6) =185a(7) =299a(8) =540a(9) =874a(10) =1518a(11) =2456a(12) =4163a(13) =6736a(14) =11239a(15) =18185a(16) =30029a(17) =48588a(18) =79685a(19) =128933a(20) =210490a(21) =340580a(22) =554332a(23) =896928a(24) =1456915a(25) =2357338a(26) =3824013a(27) =6187383

External references