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.

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

This page as a plain text file.
%I A025077 #3 Mar 30 2012 18:56:01
%S A025077 3,5,7,11,20,28,43,53,65,73,106,120,153,177,220,246,270,300,353,381,
%T A025077 454,484,559,601,686,732,780,822,917,979,1080,1140,1263,1327,1456,
%U A025077 1530,1673,1735,1823,1901,2062,2148,2301,2393,2572,2672,2863,2965,3166,3264,3475,3591
%N A025077 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023532, t = (primes).
%K A025077 nonn
%O A025077 1,1
%A A025077 _Clark Kimberling_