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 = (F(2), F(3), F(4), ...).
0

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

%S 2,3,8,13,31,50,105,170,340,550,1058,1712,3212,5197,9564,15475,28065,

%T 45410,81395,131700,233832,378348,666468,1078368,1886966,3053175,

%U 5312240,8595385

%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 = (F(2), F(3), F(4), ...).

%K nonn

%O 1,1

%A _Clark Kimberling_