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.

A236311 Riordan array ((1-x)/(1-3*x+3*x^2), x/(1-3*x+3*x^2)).

This page as a plain text file.
%I A236311 #4 Jan 22 2014 03:06:28
%S A236311 1,2,1,3,5,1,3,15,8,1,0,33,36,11,1,-9,54,117,66,14,1,-27,54,297,282,
%T A236311 105,17,1,-54,-27,594,945,555,153,20,1,-81,-297,864,2583,2295,963,210,
%U A236311 23,1,-81,-891,513,5778,7803,4725,1533,276,26,1,0,-1863,-1944,10098
%N A236311 Riordan array ((1-x)/(1-3*x+3*x^2), x/(1-3*x+3*x^2)).
%C A236311 Row sums are 3^n = A000244(n).
%C A236311 Diagonals sums are 2^n = A000079(n).
%C A236311 T(n,n) = A000012(n).
%C A236311 T(n+1,n) = A016789(n).
%C A236311 T(n+2,n) = A062741(n+1).
%C A236311 T(n+3,n) = 3*A004188(n+1).
%C A236311 T(n,0) = A057682(n+1).
%F A236311 T(n,k) = 3*T(n-1,k) + T(n-1,k-1) -3*T(n-2,k), T(0,0) = T(1,1) = 1, T(1,0) = 2, T(n,k) = 0 if k<0 or if k>n.
%e A236311 Triangle begins :
%e A236311 1;
%e A236311 2, 1;
%e A236311 3, 5, 1;
%e A236311 3, 15, 8, 1;
%e A236311 0, 33, 36, 11, 1;
%e A236311 -9, 54, 117, 66, 14, 1;
%e A236311 -27, 54, 297, 282, 105, 17, 1;
%Y A236311 Cf. A057083, A057682, A000012, A016789, A062741
%K A236311 easy,sign,tabl
%O A236311 0,2
%A A236311 _Philippe Deléham_, Jan 21 2014