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

A024857

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

Terms

    a(0) =1a(1) =2a(2) =7a(3) =11a(4) =27a(5) =44a(6) =91a(7) =147a(8) =278a(9) =450a(10) =806a(11) =1304a(12) =2257a(13) =3652a(14) =6181a(15) =10001a(16) =16677a(17) =26984a(18) =44551a(19) =72085a(20) =118220a(21) =191284a(22) =312300a(23) =505312a(24) =822513a(25) =1330854a(26) =2161907a(27) =3498039a(28) =5674751a(29) =9181940

External references