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.

A025071 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023532, t = (F(2), F(3), F(4), ...).

This page as a plain text file.
%I A025071 #6 Aug 05 2019 17:46:10
%S A025071 2,3,5,8,18,29,55,89,144,233,398,644,1076,1741,2872,4647,7519,12166,
%T A025071 19829,32084,52146,84374,136897,221504,359011,580892,939903,1520795,
%U A025071 2462295,3984077,6448956,10434630,16887767,27324981,44219513,71548675,115779134,187334574,303113708
%N A025071 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023532, t = (F(2), F(3), F(4), ...).
%K A025071 nonn
%O A025071 1,1
%A A025071 _Clark Kimberling_
%E A025071 More terms from _Sean A. Irvine_, Aug 05 2019