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.

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

This page as a plain text file.
%I A025121 #3 Mar 30 2012 18:56:01
%S A025121 1,1,3,1,4,8,14,14,21,19,27,25,34,33,43,42,54,68,83,81,97,95,112,111,
%T A025121 130,129,149,147,170,168,191,190,215,213,238,235,262,290,321,319,351,
%U A025121 349,382,381,416,414,451,449,488,486,526,525,566,565,607,603,647,643,687,685,731
%N A025121 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A000201 (lower Wythoff sequence), t = A014306.
%K A025121 nonn
%O A025121 1,3
%A A025121 _Clark Kimberling_