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.

A024366 a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = A023532.

This page as a plain text file.
%I A024366 #4 Mar 30 2012 18:55:54
%S A024366 1,0,1,1,1,2,2,2,2,3,3,3,5,3,5,4,5,6,6,5,7,7,7,8,8,8,8,10,9,9,11,10,
%T A024366 12,11,12,12,12,12,14,14,14,14,16,14,16,16,16,18,17,17,18,19,19,19,20,
%U A024366 19,21,21,21,21,23,23,24,23,23,24,25,24,26,26,26,26,29,27,28,28,28,31,29,30,31,30,31
%N A024366 a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = A023532.
%K A024366 nonn
%O A024366 1,6
%A A024366 _Clark Kimberling_