a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 2), t = (Fibonacci numbers).
A024309
a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 2), t = (Fibonacci numbers).
Terms
- a(0) =2a(1) =2a(2) =7a(3) =12a(4) =27a(5) =43a(6) =85a(7) =138a(8) =253a(9) =409a(10) =718a(11) =1162a(12) =1984a(13) =3210a(14) =5383a(15) =8710a(16) =14433a(17) =23353a(18) =38391a(19) =62118a(20) =101577a(21) =164355a(22) =267804a(23) =433316a(24) =704382a(25) =1139714a(26) =1849751a(27) =2992960a(28) =4852471a(29) =7851463
External references
- oeis: A024309