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.

A152203 Triangle T(n,k) = (2n+1-2k)*fibonacci(k), read by rows.

This page as a plain text file.
%I A152203 #6 Mar 15 2015 09:36:20
%S A152203 1,3,1,5,3,2,7,5,6,3,9,7,10,9,5,11,9,14,15,15,8,13,11,18,21,25,24,13,
%T A152203 15,13,22,27,35,40,39,21,17,15,26,33,45,56,65,63,34,19,17,30,39,55,72,
%U A152203 91,105,102,55,21,19,34,45,65,88,117,147,170,165
%N A152203 Triangle T(n,k) = (2n+1-2k)*fibonacci(k), read by rows.
%F A152203 Triangle read by rows, A099375 * A127647 = termwise products of odd numbers and the Fibonacci series.
%e A152203 First few rows of the triangle =
%e A152203 1;
%e A152203 3, 1;
%e A152203 5, 3, 2;
%e A152203 7, 5, 6, 3;
%e A152203 9, 7, 10, 9, 5;
%e A152203 11, 9, 14, 15, 15, 8;
%e A152203 13, 11, 18, 21, 25, 24, 13;
%e A152203 15, 13, 22, 27, 35, 40, 39, 21;
%e A152203 17, 15, 26, 33, 45, 56, 65, 63, 34;
%e A152203 ...
%e A152203 Row 4 = (7, 5, 6, 3) = termwise products of (7, 5, 3, 1) and (1, 1, 2, 3).
%t A152203 Flatten[Table[(2n+1-2k)Fibonacci[k],{n,15},{k,n}]] (* _Harvey P. Dale_, Mar 15 2015 *)
%Y A152203 Cf. A099375, A127647, A001891 (row sums).
%K A152203 nonn,tabl,easy
%O A152203 1,2
%A A152203 _Gary W. Adamson_, Nov 29 2008