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

A025088

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

Terms

    a(0) =3a(1) =5a(2) =12a(3) =18a(4) =38a(5) =52a(6) =95a(7) =115a(8) =206a(9) =248a(10) =426a(11) =494a(12) =827a(13) =969a(14) =1602a(15) =1848a(16) =3028a(17) =3348a(18) =5461a(19) =6123a(20) =9958a(21) =10836a(22) =17590a(23) =18970a(24) =30757a(25) =33619a(26) =54464a(27) =59522a(28) =96380a(29) =103718

External references