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 A103516 #11 Aug 31 2013 06:36:36
%S A103516 1,2,2,3,0,3,4,0,0,4,5,0,0,0,5,6,0,0,0,0,6,7,0,0,0,0,0,7,8,0,0,0,0,0,
%T A103516 0,8,9,0,0,0,0,0,0,0,9,10,0,0,0,0,0,0,0,0,10,11,0,0,0,0,0,0,0,0,0,11,
%U A103516 12,0,0,0,0,0,0,0,0,0,0,12,13,0,0,0,0,0,0,0,0,0,0,0,13,14,0,0,0,0,0,0,0,0,0
%N A103516 Triangle read by rows: count in a vee.
%C A103516 Row sums are A103517, antidiagonal sums are A187012.
%F A103516 Number triangle T(n, k)=if(k<=n, 0^(k(n-k))*(n+1), 0)
%e A103516 Triangle begins
%e A103516 1,
%e A103516 2, 2,
%e A103516 3, 0, 3,
%e A103516 4, 0, 0, 4,
%e A103516 5, 0, 0, 0, 5,
%e A103516 6, 0, 0, 0, 0, 6,
%e A103516 7, 0, 0, 0, 0, 0, 7,
%e A103516 8, 0, 0, 0, 0, 0, 0, 8,
%e A103516 ...
%t A103516 Join[{1},Flatten[Table[Flatten[Join[{n,PadRight[{},n-2,0],n}]],{n,2,15}]]] (* _Harvey P. Dale_, Mar 23 2013 *)
%o A103516 (PARI) tabl(nn) = {for (i=1, nn, for (j=1, i, if (j == 1, t = i, if (j==i, t = i, t = 0)); print1(t, ", ");); print(););} \\ _Michel Marcus_, Aug 30 2013
%K A103516 easy,nonn,tabl
%O A103516 0,2
%A A103516 _Paul Barry_, Feb 09 2005