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 A195673 #18 Mar 30 2012 18:52:06
%S A195673 -2,3,0,3,0,2,3,0,-1,0,3,0,-4,0,-2,3,0,-7,0,-1,0,3,0,-10,0,3,0,2,3,0,
%T A195673 -13,0,10,0,3,0,3,0,-16,0,20,0,0,0,-2,3,0,-19,0,33,0,-10,0,-5,0,3,0,
%U A195673 -22,0,49,0,-30,0,-5,0,2,3,0,-25,0,68
%N A195673 Triangle T(n,k) read by rows: T(0,0)=-2, T(1,0)=3, T(1,1)=0 and T(n,k) = T(n-1,k)-T(n-2,k-2) otherwise.
%C A195673 Obviously T(n,k) = 0 for all odd k.
%C A195673 Conjecture: The polynomials p(n,x) = sum_{k=0..n} T(n,k)*x^(n-k) based on this simple recurrence for other initial constant values of T(0,0)=p and T(1,0)=q are related to the S-polynomials of A053119: p(n,x,p+1,q+1)-p(n,x,p,q) = S(n,x).
%e A195673 -2;
%e A195673 3, 0;
%e A195673 3, 0, 2;
%e A195673 3, 0, -1, 0;
%e A195673 3, 0, -4, 0, -2;
%e A195673 3, 0, -7, 0, -1, 0;
%e A195673 3, 0, -10, 0, 3, 0, 2;
%e A195673 3, 0, -13, 0, 10, 0, 3, 0.
%Y A195673 Cf. A195662, A192011 (p=-1, q=2), A135929 (p=-2, q=1).
%K A195673 sign,easy,tabl
%O A195673 0,1
%A A195673 _Paul Curtz_, Sep 23 2011