login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A001950 (upper Wythoff sequence), t = A014306.
0

%I #9 Jul 20 2019 02:05:24

%S 0,2,7,5,9,7,14,24,37,35,47,45,60,57,75,72,93,90,113,137,162,160,188,

%T 185,217,214,248,245,281,279,317,314,356,353,396,390,434,429,475,525,

%U 576,574,628,625,683,680,739,737,799,797,862,859,927,924,995,990,1059,1055

%N s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A001950 (upper Wythoff sequence), t = A014306.

%Y Cf. A001950, A014306.

%K nonn

%O 1,2

%A _Clark Kimberling_

%E a(46) corrected by _Sean A. Irvine_, Jul 20 2019