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.

A024891 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023531, t = (primes).

This page as a plain text file.
%I A024891 #3 Mar 30 2012 18:56:00
%S A024891 0,0,5,7,11,13,17,19,36,46,50,60,70,74,84,94,131,139,157,171,177,193,
%T A024891 207,221,237,251,310,330,348,360,390,408,424,448,470,486,506,540,625,
%U A024891 653,673,699,739,761,781,803,835,863,891,925,953,975,1104,1136,1180,1214,1244,1270
%N A024891 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023531, t = (primes).
%K A024891 nonn
%O A024891 2,3
%A A024891 _Clark Kimberling_