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 A050158 #8 Dec 22 2017 05:15:50
%S A050158 1,2,3,5,9,10,14,28,34,35,42,90,117,125,126,132,297,407,451,461,462,
%T A050158 429,1001,1430,1638,1703,1715,1716,1430,3432,5070,5980,6330,6420,6434,
%U A050158 6435,4862,11934,18122,21930,23630,24174,24293
%N A050158 T(n, k) = S(2*n + 1, n, k + 1) for 0<=k<=n and n >= 0, array S as in A050157.
%F A050158 T(n, k) = Sum_{0<=j<=k} t(n, j), array t as in A039598.
%F A050158 T(n, k) = binomial(2*n+1, n+1) - binomial(2*n+1, n-k-1). _Peter Luschny_, Dec 22 2017
%e A050158 Triangle starts:
%e A050158 1
%e A050158 2, 3
%e A050158 5, 9, 10
%e A050158 14, 28, 34, 35
%e A050158 42, 90, 117, 125, 126
%e A050158 132, 297, 407, 451, 461, 462
%e A050158 429, 1001, 1430, 1638, 1703, 1715, 1716
%p A050158 A050158 := (n, k) -> binomial(2*n+1, n+1) - binomial(2*n+1, n-k-1):
%p A050158 seq(seq(A050158(n,k), k=0..n), n=0..6); # _Peter Luschny_, Dec 22 2017
%Y A050158 T(n, 0) = A000108(n+1).
%Y A050158 T(n, 1) = A000245(n+1).
%Y A050158 T(n, n) = A001700(n).
%Y A050158 T(n,n-1) = A010763(n).
%Y A050158 Row sums are A296770.
%Y A050158 Cf. A039598, A050157.
%K A050158 nonn,tabl
%O A050158 0,2
%A A050158 _Clark Kimberling_