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 A185911 #14 Jul 22 2017 09:15:24
%S A185911 1,1,3,1,0,5,1,0,0,7,1,0,0,0,9,1,0,0,0,0,11,1,0,0,0,0,0,13,1,0,0,0,0,
%T A185911 0,0,15,1,0,0,0,0,0,0,0,17,1,0,0,0,0,0,0,0,0,19,1,0,0,0,0,0,0,0,0,0,
%U A185911 21,1,0,0,0,0,0,0,0,0,0,0,23,1,0,0,0,0,0,0,0,0,0,0,0,25,1,0,0,0,0,0,0,0,0,0,0,0,0,27
%N A185911 Weight array of A185910, by antidiagonals.
%C A185911 A member of the accumulation chain ... < A185910 < A185911 < A185912 < A185913 < ...
%C A185911 (See A144112 for definitions of weight array and accumulation array.)
%H A185911 G. C. Greubel, <a href="/A185911/b185911.txt">Table of n, a(n) for the first 50 rows, flattened</a>
%F A185911 T(1,k) = 1 for k >= 1; T(n,1) = 2*n-1 for n >= 1; T(n,k) = 0 otherwise.
%e A185911 Northwest corner:
%e A185911 1, 1, 1, 1, 1, 1
%e A185911 3, 0, 0, 0, 0, 0
%e A185911 5, 0, 0, 0, 0, 0
%e A185911 7, 0, 0, 0, 0, 0
%e A185911 9, 0, 0, 0, 0, 0
%t A185911 f[n_, 0] := 0; f[0, k_] := 0; f[n_, k_] := n^2 + k - 1;
%t A185911 w[m_, n_] := f[m, n] + f[m - 1, n - 1] - f[m, n - 1] - f[m - 1, n] /; Or[m > 0, n > 0];
%t A185911 Table[w[n - k + 1, k], {n, 50}, {k, n, 1, -1}] // Flatten
%t A185911 T[1, k_] := 1; T[n_, 1] := 2*n - 1; T[n_, k_] := 0; Table[T[n - k + 1, k], {n, 10}, {k, n, 1, -1}]//Flatten (* _G. C. Greubel_, Jul 22 2017 *)
%Y A185911 Cf. A144112, A185910, A185912.
%K A185911 nonn,tabl
%O A185911 1,3
%A A185911 _Clark Kimberling_, Feb 06 2011