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.

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

This page as a plain text file.
%I A025070 #3 Mar 30 2012 18:56:01
%S A025070 6,8,9,10,21,24,37,42,47,51,69,75,96,102,126,135,142,150,178,187,217,
%T A025070 227,259,272,307,319,332,345,385,401,443,457,503,522,568,587,636,656,
%U A025070 675,693,747,769,825,847,906,929,991,1016,1079,1105,1172,1201,1230,1256,1324,1354
%N A025070 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023532, t = (composite numbers).
%K A025070 nonn
%O A025070 1,1
%A A025070 _Clark Kimberling_