login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...), t = (F(2), F(3), ...).
0

%I #3 Mar 30 2012 18:55:54

%S 1,2,7,11,27,44,96,155,307,497,947,1532,2752,4453,7783,12593,21421,

%T 34660,58128,94053,156357,252991,416571,674026,1104546,1787193,

%U 2916749,4719399,7678589

%N a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...), t = (F(2), F(3), ...).

%K nonn

%O 1,2

%A _Clark Kimberling_