a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (Lucas numbers).
A024459
a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (Lucas numbers).
Terms
- a(0) =1a(1) =3a(2) =7a(3) =11a(4) =26a(5) =43a(6) =90a(7) =145a(8) =290a(9) =470a(10) =904a(11) =1462a(12) =2743a(13) =4439a(14) =8169a(15) =13217a(16) =23970a(17) =38785a(18) =69520a(19) =112485a(20) =199716a(21) =323148a(22) =569232a(23) =921036a(24) =1611661a(25) =2607723a(26) =4537195a(27) =7341335
External references
- oeis: A024459