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.

A024369 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (1, p(1), p(2), ...).

This page as a plain text file.
%I A024369 #4 Mar 30 2012 18:55:54
%S A024369 1,2,3,5,10,16,25,35,43,53,76,86,119,137,170,196,220,246,293,329,382,
%T A024369 412,485,521,596,642,686,732,823,869,964,1032,1133,1199,1322,1388,
%U A024369 1517,1597,1673,1735,1894,1974,2135,2227,2380,2476,2655,2761,2952,3062,3263,3365
%N A024369 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (1, p(1), p(2), ...).
%K A024369 nonn
%O A024369 1,2
%A A024369 _Clark Kimberling_