a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (Fibonacci numbers), t = A023533.
A024466
a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (Fibonacci numbers), t = A023533.
Terms
- a(0) =1a(1) =0a(2) =0a(3) =1a(4) =1a(5) =2a(6) =3a(7) =0a(8) =0a(9) =1a(10) =1a(11) =2a(12) =3a(13) =5a(14) =8a(15) =13a(16) =21a(17) =34a(18) =55a(19) =1a(20) =1a(21) =2a(22) =3a(23) =5a(24) =8a(25) =13a(26) =21a(27) =34a(28) =55a(29) =89
External references
- oeis: A024466