cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A024691 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.

This page as a plain text file.
%I A024691 #9 Jul 20 2019 02:05:24
%S A024691 0,2,7,5,9,7,14,24,37,35,47,45,60,57,75,72,93,90,113,137,162,160,188,
%T A024691 185,217,214,248,245,281,279,317,314,356,353,396,390,434,429,475,525,
%U A024691 576,574,628,625,683,680,739,737,799,797,862,859,927,924,995,990,1059,1055
%N A024691 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 A024691 Cf. A001950, A014306.
%K A024691 nonn
%O A024691 1,2
%A A024691 _Clark Kimberling_
%E A024691 a(46) corrected by _Sean A. Irvine_, Jul 20 2019