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.

A024477 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = A014306.

This page as a plain text file.
%I A024477 #5 Dec 27 2023 12:43:53
%S A024477 0,1,4,3,5,4,8,15,26,25,41,40,66,62,102,91,149,120,196,318,515,514,
%T A024477 833,829,1343,1332,2157,2128,3445,3369,5453,5254,8503,7982,12916,
%U A024477 11550,18691,15117,24462,39582,64047,64029,103603,103556,167559,167436,270919,270597
%N A024477 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = A014306.
%Y A024477 Cf. A014306.
%K A024477 nonn
%O A024477 1,3
%A A024477 _Clark Kimberling_