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.

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

This page as a plain text file.
%I A024602 #6 Jul 17 2019 18:47:07
%S A024602 0,1,4,3,6,4,9,16,25,24,33,31,42,40,53,51,66,64,81,99,118,116,137,135,
%T A024602 158,156,181,179,206,204,233,231,262,260,292,288,321,317,352,389,428,
%U A024602 426,467,465,508,506,551,549,596,594,643,641,692,690,743,740,793,789,844,840
%N A024602 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A014306.
%K A024602 nonn
%O A024602 1,3
%A A024602 _Clark Kimberling_
%E A024602 a(59) corrected by _Sean A. Irvine_, Jul 17 2019