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.

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

This page as a plain text file.
%I A024370 #4 Mar 30 2012 18:55:54
%S A024370 4,6,8,9,18,21,33,37,42,47,63,69,89,96,117,126,135,142,168,178,207,
%T A024370 217,248,259,294,307,319,332,370,385,427,443,484,503,550,568,617,636,
%U A024370 656,675,726,747,803,825,882,906,965,991,1054,1079,1144,1172,1201,1230,1298,1324
%N A024370 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (composite numbers).
%K A024370 nonn
%O A024370 1,1
%A A024370 _Clark Kimberling_