login
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).
0

%I #3 Mar 30 2012 18:56:01

%S 3,5,12,18,38,52,95,115,206,248,426,494,827,969,1602,1848,3028,3348,

%T 5461,6123,9958,10836,17590,18970,30757,33619,54464,59522,96380,

%U 103718,167899,177531,287336,307392,497462,524884,849381,894117,1446820,1542058,2495214

%N 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).

%K nonn

%O 1,1

%A _Clark Kimberling_