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.

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

This page as a plain text file.
%I A024890 #6 Jul 27 2019 17:02:46
%S A024890 0,0,1,0,1,1,1,1,2,1,2,2,1,2,2,2,2,3,3,2,3,3,2,3,3,3,3,4,4,4,4,3,4,4,
%T A024890 3,4,4,3,5,5,5,4,5,5,5,5,4,5,5,5,5,5,5,6,6,5,6,6,5,5,6,6,5,6,6,6,6,5,
%U A024890 7,7,7,7,7,6,7,7,7,7,7,7,6,7,7,6,7,7,7,8,7,8,7,8,8,8,8,7,8,7,8,8,8,7,8,8,8,8,9,8,8,9,9,9
%N A024890 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023531, t = A014306.
%K A024890 nonn
%O A024890 2,9
%A A024890 _Clark Kimberling_
%E A024890 a(102) onward corrected by _Sean A. Irvine_, Jul 27 2019