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 = (primes).

A024468

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 = (primes).

Terms

    a(0) =2a(1) =3a(2) =8a(3) =12a(4) =28a(5) =38a(6) =73a(7) =95a(8) =170a(9) =206a(10) =352a(11) =426a(12) =715a(13) =827a(14) =1368a(15) =1602a(16) =2630a(17) =3028a(18) =4943a(19) =5461a(20) =8882a(21) =9958a(22) =16164a(23) =17590a(24) =28523a(25) =30757a(26) =49830a(27) =54464a(28) =88192a(29) =96380

External references