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.

A024373 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = A000201 (lower Wythoff sequence).

This page as a plain text file.
%I A024373 #4 Mar 30 2012 18:55:54
%S A024373 1,3,4,6,12,15,25,29,34,39,52,60,77,84,106,115,125,135,160,172,199,
%T A024373 213,245,259,295,310,326,343,383,400,443,463,510,531,580,603,656,680,
%U A024373 704,729,787,812,874,901,965,995,1061,1093,1164,1196,1270,1303,1337,1372,1450,1486
%N A024373 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = A000201 (lower Wythoff sequence).
%K A024373 nonn
%O A024373 1,2
%A A024373 _Clark Kimberling_