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.

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

This page as a plain text file.
%I A024879 #3 Mar 30 2012 18:56:00
%S A024879 0,0,0,0,1,0,0,0,1,0,0,1,0,1,0,0,1,0,0,1,1,0,1,0,0,0,2,0,0,1,0,1,0,1,
%T A024879 1,0,0,1,1,0,0,1,0,1,1,0,2,0,0,0,1,0,1,1,0,1,1,0,0,1,1,1,0,0,1,1,0,1,
%U A024879 1,0,0,2,0,0,0,0,3,0,1,1,0,0,1,1,0,0,1,0,1,2,0,0,1,0,1,1,1,1,0,0,0,2,0,1,0,0,2,1,0,1,1
%N A024879 a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = A023531.
%K A024879 nonn
%O A024879 2,27
%A A024879 _Clark Kimberling_