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.

A024884 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023531, t = (composite numbers).

This page as a plain text file.
%I A024884 #3 Mar 30 2012 18:56:00
%S A024884 0,0,8,9,10,12,14,15,28,32,35,37,40,44,46,48,69,73,77,81,85,89,93,96,
%T A024884 100,104,133,139,144,148,154,162,166,170,176,181,187,191,229,236,242,
%U A024884 248,255,262,268,275,281,287,294,301,308,314,361,370,380,386,394,401,408,418,425
%N A024884 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023531, t = (composite numbers).
%K A024884 nonn
%O A024884 2,3
%A A024884 _Clark Kimberling_