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.
%I A216229 #7 Mar 15 2013 12:40:21
%S A216229 1,1,1,1,2,0,0,3,2,0,0,3,5,0,0,0,0,8,5,0,0,0,0,8,13,0,0,0,0,0,0,21,13,
%T A216229 0,0,0,0,0,0,21,34,0,0,0,0,0,0,0,0,55,34,0,0,0,0,0,0,0,0,55,89,0,0,0,
%U A216229 0,0,0,0
%N A216229 Square array T, read by antidiagonals: T(n,k) = 0 if n-k>=2 or if k-n>=3, T(1,0) = T(0,0) = T(0,1) = T(0,2) = 1, T(n,k) = T(n-1,k) + T(n,k-1).
%F A216229 T(n,n) = T(n+1,n) = A001519(n+1).
%F A216229 T(n,n+1) = T(n,n+2) = A001906(n+1).
%F A216229 Sum_{k, 0<=k<=n} T(n-k,k) = A000045(n+2).
%F A216229 T(n,k) = A216226(n,k+1).
%e A216229 Square array begins:
%e A216229 1, 1, 1, 0, 0, 0, 0, 0, ... row n=0
%e A216229 1, 2, 3, 3, 0, 0, 0, 0, ... row n=1
%e A216229 0, 2, 5, 8, 8, 0, 0, 0, ... row n=2
%e A216229 0, 0, 5, 13, 21, 21, 0, 0, ... row n=3
%e A216229 0, 0, 0, 13, 34, 55, 55, 0, ... row n=4
%e A216229 0, 0, 0, 0, 34, 89, 144, 144, ... row n=5
%e A216229 ...
%Y A216229 Cf. A000045 (Fibonacci numbers), A001519, A001906, A216226
%K A216229 nonn,tabl
%O A216229 0,5
%A A216229 _Philippe Deléham_, Mar 14 2013