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.

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

This page as a plain text file.
%I A024882 #3 Mar 30 2012 18:56:00
%S A024882 0,0,4,7,11,18,29,47,94,152,246,398,644,1042,1686,2728,4537,7341,
%T A024882 11878,19219,31097,50316,81413,131729,213142,344871,559377,905091,
%U A024882 1464468,2369559,3834027,6203586
%N A024882 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023531, t = (Lucas numbers).
%K A024882 nonn
%O A024882 2,3
%A A024882 _Clark Kimberling_