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.

A216210 Square array T read by antidiagonals: T(n,k) = 0 if n-k>=4 or if k-n>=4, T(3,0) = T(2,0) = TT(1,0) = T(0,0) = T(0,1) = T(0,2) = T(0,3) = 1, T(n,k) = T(n-1,k) + T(n,k-1).

This page as a plain text file.
%I A216210 #7 Mar 13 2013 13:30:44
%S A216210 1,1,1,1,2,1,1,3,3,1,0,4,6,4,0,0,4,10,10,4,0,0,0,14,20,14,0,0,0,0,14,
%T A216210 34,34,14,0,0,0,0,0,48,68,48,0,0,0,0,0,0,48,116,116,48,0,0,0,0,0,0,0,
%U A216210 164,232,164,0,0,0,0
%N A216210 Square array T read by antidiagonals: T(n,k) = 0 if n-k>=4 or if k-n>=4, T(3,0) = T(2,0) = TT(1,0) = T(0,0) = T(0,1) = T(0,2) = T(0,3) = 1, T(n,k) = T(n-1,k) + T(n,k-1).
%F A216210 T(n,n) = A006012(n).
%F A216210 T(n,n+1) = T(n+1,n) = A007052(n).
%F A216210 T(n,n+2) = T(n,n+3) = T(n+2,n) = T(n+3,n) = A007070(n).
%F A216210 Sum_{k, 0<=k<=n} T(n-k,k) = A068912(n).
%e A216210 Square array begins:
%e A216210 1, 1,  1,  1,   0,   0,   0,    0,    0, 0, ... row n=0
%e A216210 1, 2,  3,  4,   4,   0,   0,    0,    0, 0, ... row n=1
%e A216210 1, 3,  6, 10,  14,  14,   0,    0,    0, 0, ... row n=2
%e A216210 1, 4, 10, 20,  34,  48,  48,    0,    0, 0, ... row n=3
%e A216210 0, 4, 14, 34,  68, 116, 164,  164,    0, 0, ... row n=4
%e A216210 0, 0, 14, 48, 116, 232, 396,  560,  560, 0, ... row n=5
%e A216210 0, 0,  0, 48, 164, 396, 792, 1352, 1912, 1912,  row n=6
%e A216210 ...
%Y A216210 Cf. A006012, A007052, A007070, A068912
%K A216210 nonn,tabl
%O A216210 0,5
%A A216210 _Philippe Deléham_, Mar 12 2013