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.

A024886 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023531, t = (odd natural numbers).

This page as a plain text file.
%I A024886 #3 Mar 30 2012 18:56:00
%S A024886 0,0,5,7,9,11,13,15,28,32,36,40,44,48,52,56,79,85,91,97,103,109,115,
%T A024886 121,127,133,168,176,184,192,200,208,216,224,232,240,248,256,305,315,
%U A024886 325,335,345,355,365,375,385,395,405,415,425,435,500,512,524,536,548,560,572,584,596
%N A024886 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023531, t = (odd natural numbers).
%K A024886 nonn
%O A024886 2,3
%A A024886 _Clark Kimberling_