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.

A024696 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A014306, t = (primes).

This page as a plain text file.
%I A024696 #3 Mar 30 2012 18:55:59
%S A024696 0,0,3,5,12,18,24,30,47,55,82,96,127,149,186,210,261,293,319,349,412,
%T A024696 444,517,557,634,680,773,819,918,976,1079,1147,1268,1324,1455,1535,
%U A024696 1680,1758,1844,1918,2075,2167,2334,2422,2607,2703,2890,3002,3213,3311,3522,3634
%N A024696 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A014306, t = (primes).
%K A024696 nonn
%O A024696 1,3
%A A024696 _Clark Kimberling_