a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2), t = A000045 (Fibonacci numbers).

A023860

a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2), t = A000045 (Fibonacci numbers).

Terms

    a(0) =1a(1) =1a(2) =4a(3) =7a(4) =17a(5) =27a(6) =56a(7) =91a(8) =172a(9) =278a(10) =498a(11) =806a(12) =1395a(13) =2257a(14) =3820a(15) =6181a(16) =10307a(17) =16677a(18) =27534a(19) =44551a(20) =73064a(21) =118220a(22) =193012a(23) =312300a(24) =508341a(25) =822513a(26) =1336132a(27) =2161907a(28) =3507189a(29) =5674751

External references